YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-21 22:48:11,410 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-21 22:48:11,413 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-21 22:48:11,423 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-21 22:48:11,424 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-21 22:48:11,425 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-21 22:48:11,426 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-21 22:48:11,427 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-21 22:48:11,429 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-21 22:48:11,430 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-21 22:48:11,430 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-21 22:48:11,431 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-21 22:48:11,432 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-21 22:48:11,432 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-21 22:48:11,433 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-21 22:48:11,434 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-21 22:48:11,435 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-21 22:48:11,437 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-21 22:48:11,438 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-21 22:48:11,440 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-21 22:48:11,441 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-21 22:48:11,442 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-21 22:48:11,444 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-21 22:48:11,444 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-21 22:48:11,444 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-21 22:48:11,445 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-21 22:48:11,445 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-21 22:48:11,446 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-21 22:48:11,446 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-21 22:48:11,447 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-21 22:48:11,448 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-21 22:48:11,448 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-21 22:48:11,449 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-21 22:48:11,450 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-21 22:48:11,450 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-21 22:48:11,450 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-21 22:48:11,450 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-21 22:48:11,451 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-21 22:48:11,452 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-21 22:48:11,452 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-21 22:48:11,466 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-21 22:48:11,467 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-21 22:48:11,468 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-21 22:48:11,468 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-21 22:48:11,468 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-21 22:48:11,468 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-21 22:48:11,468 INFO L133 SettingsManager]: * Use SBE=true [2020-06-21 22:48:11,468 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-21 22:48:11,469 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-21 22:48:11,469 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-21 22:48:11,469 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-21 22:48:11,469 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-21 22:48:11,469 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-21 22:48:11,469 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-21 22:48:11,469 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 22:48:11,470 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-21 22:48:11,470 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-21 22:48:11,470 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-21 22:48:11,470 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-21 22:48:11,470 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-21 22:48:11,470 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-21 22:48:11,471 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-21 22:48:11,471 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-21 22:48:11,471 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-21 22:48:11,471 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-21 22:48:11,471 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-21 22:48:11,471 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-21 22:48:11,472 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-21 22:48:11,472 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-21 22:48:11,497 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-21 22:48:11,511 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-21 22:48:11,515 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-21 22:48:11,517 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-21 22:48:11,518 INFO L276 PluginConnector]: CDTParser initialized [2020-06-21 22:48:11,519 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-21 22:48:11,586 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/e2a85f4995fa4fcca0d42c9fb2fb06d9/FLAG541d22e85 [2020-06-21 22:48:11,913 INFO L307 CDTParser]: Found 1 translation units. [2020-06-21 22:48:11,914 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-21 22:48:11,938 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/e2a85f4995fa4fcca0d42c9fb2fb06d9/FLAG541d22e85 [2020-06-21 22:48:12,331 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/e2a85f4995fa4fcca0d42c9fb2fb06d9 [2020-06-21 22:48:12,342 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-21 22:48:12,343 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-21 22:48:12,344 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-21 22:48:12,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-21 22:48:12,348 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-21 22:48:12,349 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.06 10:48:12" (1/1) ... [2020-06-21 22:48:12,352 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54430127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:48:12, skipping insertion in model container [2020-06-21 22:48:12,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.06 10:48:12" (1/1) ... [2020-06-21 22:48:12,360 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-21 22:48:12,377 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-21 22:48:12,532 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-21 22:48:12,537 INFO L191 MainTranslator]: Completed pre-run [2020-06-21 22:48:12,553 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-21 22:48:12,628 INFO L195 MainTranslator]: Completed translation [2020-06-21 22:48:12,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:48:12 WrapperNode [2020-06-21 22:48:12,629 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-21 22:48:12,630 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-21 22:48:12,630 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-21 22:48:12,630 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-21 22:48:12,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:48:12" (1/1) ... [2020-06-21 22:48:12,646 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:48:12" (1/1) ... [2020-06-21 22:48:12,665 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-21 22:48:12,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-21 22:48:12,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-21 22:48:12,666 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-21 22:48:12,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:48:12" (1/1) ... [2020-06-21 22:48:12,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:48:12" (1/1) ... [2020-06-21 22:48:12,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:48:12" (1/1) ... [2020-06-21 22:48:12,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:48:12" (1/1) ... [2020-06-21 22:48:12,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:48:12" (1/1) ... [2020-06-21 22:48:12,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:48:12" (1/1) ... [2020-06-21 22:48:12,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:48:12" (1/1) ... [2020-06-21 22:48:12,685 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-21 22:48:12,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-21 22:48:12,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-21 22:48:12,686 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-21 22:48:12,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:48:12" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-21 22:48:12,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-21 22:48:12,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-21 22:48:12,896 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-21 22:48:12,896 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2020-06-21 22:48:12,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.06 10:48:12 BoogieIcfgContainer [2020-06-21 22:48:12,898 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-21 22:48:12,898 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-21 22:48:12,899 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-21 22:48:12,901 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-21 22:48:12,902 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.06 10:48:12" (1/1) ... [2020-06-21 22:48:12,917 INFO L313 BlockEncoder]: Initial Icfg 7 locations, 9 edges [2020-06-21 22:48:12,919 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-21 22:48:12,919 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-21 22:48:12,920 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-21 22:48:12,920 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-21 22:48:12,922 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-21 22:48:12,923 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-21 22:48:12,923 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-21 22:48:12,938 INFO L185 BlockEncoder]: Using Use SBE [2020-06-21 22:48:12,946 INFO L200 BlockEncoder]: SBE split 0 edges [2020-06-21 22:48:12,951 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-21 22:48:12,953 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-21 22:48:12,971 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding [2020-06-21 22:48:12,973 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-21 22:48:12,975 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-21 22:48:12,975 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-21 22:48:12,975 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-21 22:48:12,975 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-21 22:48:12,976 INFO L313 BlockEncoder]: Encoded RCFG 3 locations, 4 edges [2020-06-21 22:48:12,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 21.06 10:48:12 BasicIcfg [2020-06-21 22:48:12,976 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-21 22:48:12,977 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-21 22:48:12,977 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-21 22:48:12,980 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-21 22:48:12,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.06 10:48:12" (1/4) ... [2020-06-21 22:48:12,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d8b7017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.06 10:48:12, skipping insertion in model container [2020-06-21 22:48:12,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:48:12" (2/4) ... [2020-06-21 22:48:12,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d8b7017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.06 10:48:12, skipping insertion in model container [2020-06-21 22:48:12,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.06 10:48:12" (3/4) ... [2020-06-21 22:48:12,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d8b7017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.06 10:48:12, skipping insertion in model container [2020-06-21 22:48:12,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 21.06 10:48:12" (4/4) ... [2020-06-21 22:48:12,984 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-21 22:48:12,994 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-21 22:48:13,001 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-21 22:48:13,018 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-21 22:48:13,047 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-21 22:48:13,047 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-21 22:48:13,048 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-21 22:48:13,048 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-21 22:48:13,048 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-21 22:48:13,048 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-21 22:48:13,048 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-21 22:48:13,048 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-21 22:48:13,049 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-21 22:48:13,063 INFO L276 IsEmpty]: Start isEmpty. Operand 3 states. [2020-06-21 22:48:13,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-21 22:48:13,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 3 states. [2020-06-21 22:48:13,120 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 21) no Hoare annotation was computed. [2020-06-21 22:48:13,120 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-21 22:48:13,120 INFO L451 ceAbstractionStarter]: At program point L15-2(lines 14 22) the Hoare annotation is: true [2020-06-21 22:48:13,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.06 10:48:13 BasicIcfg [2020-06-21 22:48:13,129 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-21 22:48:13,129 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-21 22:48:13,129 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-21 22:48:13,133 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-21 22:48:13,134 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-21 22:48:13,134 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.06 10:48:12" (1/5) ... [2020-06-21 22:48:13,134 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@35dd4320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.06 10:48:13, skipping insertion in model container [2020-06-21 22:48:13,135 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-21 22:48:13,135 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:48:12" (2/5) ... [2020-06-21 22:48:13,135 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@35dd4320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.06 10:48:13, skipping insertion in model container [2020-06-21 22:48:13,135 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-21 22:48:13,135 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.06 10:48:12" (3/5) ... [2020-06-21 22:48:13,136 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@35dd4320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.06 10:48:13, skipping insertion in model container [2020-06-21 22:48:13,136 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-21 22:48:13,136 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 21.06 10:48:12" (4/5) ... [2020-06-21 22:48:13,136 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@35dd4320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.06 10:48:13, skipping insertion in model container [2020-06-21 22:48:13,137 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-21 22:48:13,137 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.06 10:48:13" (5/5) ... [2020-06-21 22:48:13,138 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-21 22:48:13,164 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-21 22:48:13,164 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-21 22:48:13,165 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-21 22:48:13,165 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-21 22:48:13,165 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-21 22:48:13,165 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-21 22:48:13,166 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-21 22:48:13,166 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-21 22:48:13,166 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-21 22:48:13,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-06-21 22:48:13,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-21 22:48:13,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 22:48:13,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 22:48:13,191 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-21 22:48:13,191 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-21 22:48:13,191 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-21 22:48:13,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-06-21 22:48:13,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-21 22:48:13,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 22:48:13,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 22:48:13,192 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-21 22:48:13,193 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-21 22:48:13,198 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [26] ULTIMATE.startENTRY-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~c~0] 5#L15-2true [2020-06-21 22:48:13,198 INFO L796 eck$LassoCheckResult]: Loop: 5#L15-2true [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3#L15true [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 5#L15-2true [2020-06-21 22:48:13,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:48:13,204 INFO L82 PathProgramCache]: Analyzing trace with hash 57, now seen corresponding path program 1 times [2020-06-21 22:48:13,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:48:13,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:48:13,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:13,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 22:48:13,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:13,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:48:13,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1956, now seen corresponding path program 1 times [2020-06-21 22:48:13,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:48:13,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:48:13,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:13,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 22:48:13,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:13,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:13,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:48:13,290 INFO L82 PathProgramCache]: Analyzing trace with hash 55772, now seen corresponding path program 1 times [2020-06-21 22:48:13,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:48:13,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:48:13,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:13,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 22:48:13,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:13,352 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 22:48:13,353 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 22:48:13,353 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 22:48:13,353 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 22:48:13,353 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-21 22:48:13,354 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 22:48:13,354 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 22:48:13,354 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 22:48:13,354 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-21 22:48:13,354 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 22:48:13,355 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 22:48:13,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:13,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:13,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:13,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:13,524 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 22:48:13,525 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 22:48:13,532 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 22:48:13,532 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-21 22:48:13,566 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-21 22:48:13,566 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 22:48:13,582 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-21 22:48:13,582 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=1} Honda state: {ULTIMATE.start_main_~c~0=1} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0=1}, {ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=0}] Lambdas: [1, 0, 0] Nus: [0, 0] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 22:48:13,610 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 22:48:13,611 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 22:48:13,640 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-21 22:48:13,640 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 22:48:13,646 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 22:48:13,646 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 22:48:13,673 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-21 22:48:13,673 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 22:48:13,679 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 22:48:13,679 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-21 22:48:13,711 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-21 22:48:13,711 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 22:48:13,742 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-21 22:48:13,744 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 22:48:13,744 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 22:48:13,744 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 22:48:13,744 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 22:48:13,744 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-21 22:48:13,744 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-21 22:48:13,745 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 22:48:13,745 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 22:48:13,745 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-21 22:48:13,745 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 22:48:13,745 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 22:48:13,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:13,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:13,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:13,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:13,852 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 22:48:13,857 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-21 22:48:13,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:48:13,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:48:13,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 22:48:13,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:48:13,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:48:13,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:48:13,864 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 22:48:13,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 22:48:13,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 22:48:13,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:48:13,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:48:13,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:48:13,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:48:13,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:48:13,878 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-21 22:48:13,878 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-21 22:48:13,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 22:48:13,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:48:13,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:48:13,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:48:13,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:48:13,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:48:13,894 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-21 22:48:13,895 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-21 22:48:13,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 22:48:13,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:48:13,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:48:13,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 22:48:13,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:48:13,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:48:13,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:48:13,907 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 22:48:13,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 22:48:13,914 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-21 22:48:13,919 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-21 22:48:13,920 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-21 22:48:13,922 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-21 22:48:13,922 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-21 22:48:13,922 INFO L518 LassoAnalysis]: Proved termination. [2020-06-21 22:48:13,923 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 211 Supporting invariants [] [2020-06-21 22:48:13,924 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-21 22:48:13,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:48:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:13,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-21 22:48:13,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:13,978 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-21 22:48:13,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:13,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-21 22:48:13,994 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization [2020-06-21 22:48:13,998 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-21 22:48:14,000 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 3 states. Second operand 3 states. [2020-06-21 22:48:14,024 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 3 states.. Second operand 3 states. Result 7 states and 10 transitions. Complement of second has 4 states. [2020-06-21 22:48:14,024 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-21 22:48:14,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-21 22:48:14,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2020-06-21 22:48:14,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 2 letters. [2020-06-21 22:48:14,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 22:48:14,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 2 letters. [2020-06-21 22:48:14,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 22:48:14,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 4 letters. [2020-06-21 22:48:14,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 22:48:14,036 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 10 transitions. [2020-06-21 22:48:14,037 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-21 22:48:14,041 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 7 states and 10 transitions. [2020-06-21 22:48:14,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-06-21 22:48:14,042 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-06-21 22:48:14,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2020-06-21 22:48:14,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-21 22:48:14,043 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-06-21 22:48:14,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2020-06-21 22:48:14,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-06-21 22:48:14,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-21 22:48:14,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2020-06-21 22:48:14,071 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-06-21 22:48:14,071 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-06-21 22:48:14,071 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-21 22:48:14,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2020-06-21 22:48:14,072 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-21 22:48:14,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 22:48:14,072 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 22:48:14,073 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-21 22:48:14,073 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-21 22:48:14,073 INFO L794 eck$LassoCheckResult]: Stem: 45#ULTIMATE.startENTRY [26] ULTIMATE.startENTRY-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~c~0] 46#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 41#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 42#L15-2 [2020-06-21 22:48:14,074 INFO L796 eck$LassoCheckResult]: Loop: 42#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 47#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 42#L15-2 [2020-06-21 22:48:14,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:48:14,074 INFO L82 PathProgramCache]: Analyzing trace with hash 55762, now seen corresponding path program 1 times [2020-06-21 22:48:14,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:48:14,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:48:14,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:14,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 22:48:14,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:14,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:48:14,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1956, now seen corresponding path program 2 times [2020-06-21 22:48:14,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:48:14,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:48:14,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:14,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 22:48:14,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:14,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:14,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:48:14,092 INFO L82 PathProgramCache]: Analyzing trace with hash 53588277, now seen corresponding path program 1 times [2020-06-21 22:48:14,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:48:14,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:48:14,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:14,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 22:48:14,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:14,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-21 22:48:14,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-21 22:48:14,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-21 22:48:14,157 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 22:48:14,157 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 22:48:14,157 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 22:48:14,157 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 22:48:14,157 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-21 22:48:14,157 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 22:48:14,158 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 22:48:14,158 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 22:48:14,158 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-21 22:48:14,158 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 22:48:14,158 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 22:48:14,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:14,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:14,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:14,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:14,237 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 22:48:14,237 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-21 22:48:14,246 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 22:48:14,246 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 22:48:14,273 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-21 22:48:14,273 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 22:48:14,281 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 22:48:14,282 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 22:48:14,313 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-21 22:48:14,313 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 22:48:14,345 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-21 22:48:14,347 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 22:48:14,347 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 22:48:14,347 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 22:48:14,347 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 22:48:14,347 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-21 22:48:14,347 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-21 22:48:14,347 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 22:48:14,348 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 22:48:14,348 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-21 22:48:14,348 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 22:48:14,348 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 22:48:14,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:14,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:14,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:14,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:14,437 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 22:48:14,437 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-21 22:48:14,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:48:14,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:48:14,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:48:14,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:48:14,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:48:14,441 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-21 22:48:14,441 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-21 22:48:14,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 22:48:14,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:48:14,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:48:14,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 22:48:14,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:48:14,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:48:14,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:48:14,448 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 22:48:14,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 22:48:14,453 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-21 22:48:14,456 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-21 22:48:14,457 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-21 22:48:14,457 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-21 22:48:14,457 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-21 22:48:14,457 INFO L518 LassoAnalysis]: Proved termination. [2020-06-21 22:48:14,457 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 211 Supporting invariants [] [2020-06-21 22:48:14,458 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-21 22:48:14,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:48:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:14,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-21 22:48:14,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:14,491 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-21 22:48:14,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:14,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-21 22:48:14,492 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization [2020-06-21 22:48:14,493 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-21 22:48:14,493 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-06-21 22:48:14,506 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 9 states and 13 transitions. Complement of second has 4 states. [2020-06-21 22:48:14,507 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-21 22:48:14,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-21 22:48:14,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2020-06-21 22:48:14,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 2 letters. [2020-06-21 22:48:14,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 22:48:14,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2020-06-21 22:48:14,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 22:48:14,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 4 letters. [2020-06-21 22:48:14,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 22:48:14,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 13 transitions. [2020-06-21 22:48:14,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-21 22:48:14,511 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 13 transitions. [2020-06-21 22:48:14,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-06-21 22:48:14,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-06-21 22:48:14,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2020-06-21 22:48:14,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-21 22:48:14,514 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2020-06-21 22:48:14,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2020-06-21 22:48:14,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 5. [2020-06-21 22:48:14,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-21 22:48:14,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2020-06-21 22:48:14,516 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2020-06-21 22:48:14,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-21 22:48:14,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-21 22:48:14,520 INFO L87 Difference]: Start difference. First operand 5 states and 7 transitions. Second operand 4 states. [2020-06-21 22:48:14,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-21 22:48:14,544 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2020-06-21 22:48:14,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-21 22:48:14,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2020-06-21 22:48:14,547 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-21 22:48:14,547 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 7 states and 9 transitions. [2020-06-21 22:48:14,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-06-21 22:48:14,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2020-06-21 22:48:14,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. [2020-06-21 22:48:14,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-21 22:48:14,548 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-06-21 22:48:14,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. [2020-06-21 22:48:14,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2020-06-21 22:48:14,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-21 22:48:14,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2020-06-21 22:48:14,549 INFO L729 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2020-06-21 22:48:14,549 INFO L609 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2020-06-21 22:48:14,549 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-21 22:48:14,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. [2020-06-21 22:48:14,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-21 22:48:14,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 22:48:14,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 22:48:14,551 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2020-06-21 22:48:14,551 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-21 22:48:14,551 INFO L794 eck$LassoCheckResult]: Stem: 111#ULTIMATE.startENTRY [26] ULTIMATE.startENTRY-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~c~0] 112#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 109#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 110#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 107#L15 [2020-06-21 22:48:14,552 INFO L796 eck$LassoCheckResult]: Loop: 107#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 108#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 107#L15 [2020-06-21 22:48:14,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:48:14,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1728963, now seen corresponding path program 2 times [2020-06-21 22:48:14,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:48:14,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:48:14,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:14,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 22:48:14,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:14,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:48:14,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1736, now seen corresponding path program 1 times [2020-06-21 22:48:14,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:48:14,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:48:14,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:14,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 22:48:14,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:14,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:48:14,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1661534218, now seen corresponding path program 2 times [2020-06-21 22:48:14,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:48:14,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:48:14,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:14,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 22:48:14,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:14,598 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 22:48:14,599 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 22:48:14,599 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 22:48:14,599 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 22:48:14,599 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-21 22:48:14,599 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 22:48:14,599 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 22:48:14,600 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 22:48:14,600 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-21 22:48:14,600 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 22:48:14,600 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 22:48:14,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:14,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:14,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:14,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:14,666 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 22:48:14,666 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 22:48:14,673 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 22:48:14,673 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 22:48:14,701 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-21 22:48:14,701 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} 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-21 22:48:14,708 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 22:48:14,708 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-21 22:48:14,744 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-21 22:48:14,744 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 22:48:14,817 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-21 22:48:14,820 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 22:48:14,820 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 22:48:14,820 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 22:48:14,820 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 22:48:14,820 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-21 22:48:14,820 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-21 22:48:14,820 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 22:48:14,820 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 22:48:14,821 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-21 22:48:14,821 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 22:48:14,821 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 22:48:14,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:14,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:14,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:14,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:14,906 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 22:48:14,906 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-21 22:48:14,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:48:14,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:48:14,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:48:14,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:48:14,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:48:14,910 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-21 22:48:14,910 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-21 22:48:14,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 22:48:14,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:48:14,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:48:14,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 22:48:14,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:48:14,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:48:14,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:48:14,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 22:48:14,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 22:48:14,921 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-21 22:48:14,925 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-21 22:48:14,925 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-21 22:48:14,926 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-21 22:48:14,926 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-21 22:48:14,926 INFO L518 LassoAnalysis]: Proved termination. [2020-06-21 22:48:14,926 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2020-06-21 22:48:14,927 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-21 22:48:14,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:48:14,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:14,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-21 22:48:14,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:14,950 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-21 22:48:14,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:14,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-21 22:48:14,970 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-21 22:48:14,970 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-21 22:48:14,970 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 6 states and 8 transitions. cyclomatic complexity: 3 Second operand 3 states. [2020-06-21 22:48:14,992 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 6 states and 8 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 10 states and 14 transitions. Complement of second has 4 states. [2020-06-21 22:48:14,992 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-21 22:48:14,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-21 22:48:14,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2020-06-21 22:48:14,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2020-06-21 22:48:14,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 22:48:14,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2020-06-21 22:48:14,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 22:48:14,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 4 letters. [2020-06-21 22:48:14,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 22:48:14,996 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 14 transitions. [2020-06-21 22:48:14,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-21 22:48:14,997 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 9 states and 12 transitions. [2020-06-21 22:48:14,997 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-06-21 22:48:14,997 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-06-21 22:48:14,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2020-06-21 22:48:14,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-21 22:48:14,998 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2020-06-21 22:48:14,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2020-06-21 22:48:14,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2020-06-21 22:48:14,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-21 22:48:14,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2020-06-21 22:48:14,999 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-06-21 22:48:14,999 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-06-21 22:48:14,999 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-21 22:48:14,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2020-06-21 22:48:15,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-21 22:48:15,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 22:48:15,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 22:48:15,000 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2020-06-21 22:48:15,000 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-06-21 22:48:15,001 INFO L794 eck$LassoCheckResult]: Stem: 165#ULTIMATE.startENTRY [26] ULTIMATE.startENTRY-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~c~0] 166#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 163#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 164#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 161#L15 [2020-06-21 22:48:15,001 INFO L796 eck$LassoCheckResult]: Loop: 161#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 162#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 163#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 164#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 161#L15 [2020-06-21 22:48:15,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:48:15,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1728963, now seen corresponding path program 3 times [2020-06-21 22:48:15,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:48:15,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:48:15,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:15,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 22:48:15,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:15,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:15,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:48:15,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1669381, now seen corresponding path program 1 times [2020-06-21 22:48:15,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:48:15,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:48:15,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:15,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 22:48:15,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:15,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:15,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:15,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:48:15,018 INFO L82 PathProgramCache]: Analyzing trace with hash -993449529, now seen corresponding path program 3 times [2020-06-21 22:48:15,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:48:15,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:48:15,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:15,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 22:48:15,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:15,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:15,078 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 22:48:15,078 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 22:48:15,078 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 22:48:15,078 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 22:48:15,079 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-21 22:48:15,079 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 22:48:15,079 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 22:48:15,079 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 22:48:15,079 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-21 22:48:15,079 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 22:48:15,080 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 22:48:15,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:15,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:15,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:15,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:15,161 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 22:48:15,161 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 22:48:15,168 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 22:48:15,169 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 22:48:15,196 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-21 22:48:15,196 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 22:48:15,219 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 22:48:15,219 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 22:48:15,246 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-21 22:48:15,246 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=2} Honda state: {ULTIMATE.start_main_~c~0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 22:48:15,251 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 22:48:15,252 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 22:48:15,283 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-21 22:48:15,283 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 22:48:15,287 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-21 22:48:15,312 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 22:48:15,312 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 22:48:15,312 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 22:48:15,312 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 22:48:15,312 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-21 22:48:15,312 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-21 22:48:15,312 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 22:48:15,313 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 22:48:15,313 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-21 22:48:15,313 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 22:48:15,313 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 22:48:15,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:15,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:15,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:15,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:15,372 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 22:48:15,373 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-21 22:48:15,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:48:15,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:48:15,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 22:48:15,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:48:15,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:48:15,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:48:15,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 22:48:15,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 22:48:15,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 22:48:15,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:48:15,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:48:15,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:48:15,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:48:15,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:48:15,381 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-21 22:48:15,381 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-21 22:48:15,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 22:48:15,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:48:15,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:48:15,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 22:48:15,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:48:15,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:48:15,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:48:15,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 22:48:15,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 22:48:15,390 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-21 22:48:15,393 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-21 22:48:15,393 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-21 22:48:15,393 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-21 22:48:15,394 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-21 22:48:15,394 INFO L518 LassoAnalysis]: Proved termination. [2020-06-21 22:48:15,394 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 221 Supporting invariants [] [2020-06-21 22:48:15,394 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-21 22:48:15,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:48:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:15,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-21 22:48:15,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:15,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-21 22:48:15,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:15,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-21 22:48:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:15,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-21 22:48:15,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:15,487 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-21 22:48:15,488 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-21 22:48:15,488 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2020-06-21 22:48:15,517 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 22 states and 27 transitions. Complement of second has 8 states. [2020-06-21 22:48:15,518 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-21 22:48:15,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-21 22:48:15,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2020-06-21 22:48:15,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 4 letters. [2020-06-21 22:48:15,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 22:48:15,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 4 letters. [2020-06-21 22:48:15,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 22:48:15,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 8 letters. [2020-06-21 22:48:15,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 22:48:15,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2020-06-21 22:48:15,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-06-21 22:48:15,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 17 states and 22 transitions. [2020-06-21 22:48:15,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-06-21 22:48:15,524 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2020-06-21 22:48:15,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2020-06-21 22:48:15,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-21 22:48:15,525 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2020-06-21 22:48:15,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2020-06-21 22:48:15,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2020-06-21 22:48:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-21 22:48:15,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2020-06-21 22:48:15,527 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-06-21 22:48:15,527 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-06-21 22:48:15,527 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-21 22:48:15,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2020-06-21 22:48:15,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-21 22:48:15,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 22:48:15,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 22:48:15,528 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2020-06-21 22:48:15,528 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2020-06-21 22:48:15,528 INFO L794 eck$LassoCheckResult]: Stem: 252#ULTIMATE.startENTRY [26] ULTIMATE.startENTRY-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~c~0] 253#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 254#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 256#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 257#L15 [2020-06-21 22:48:15,529 INFO L796 eck$LassoCheckResult]: Loop: 257#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 260#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 259#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 258#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 254#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 256#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 257#L15 [2020-06-21 22:48:15,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:48:15,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1728963, now seen corresponding path program 4 times [2020-06-21 22:48:15,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:48:15,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:48:15,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:15,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 22:48:15,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:15,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:48:15,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1603978316, now seen corresponding path program 2 times [2020-06-21 22:48:15,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:48:15,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:48:15,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:15,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 22:48:15,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:15,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:48:15,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1222554482, now seen corresponding path program 4 times [2020-06-21 22:48:15,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:48:15,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:48:15,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:15,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 22:48:15,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:15,574 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-21 22:48:15,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-21 22:48:15,575 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-21 22:48:15,589 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2020-06-21 22:48:15,599 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-06-21 22:48:15,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-21 22:48:15,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-21 22:48:15,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:15,606 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-21 22:48:15,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-21 22:48:15,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-06-21 22:48:15,689 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 22:48:15,689 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 22:48:15,689 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 22:48:15,689 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 22:48:15,690 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-21 22:48:15,690 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 22:48:15,690 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 22:48:15,690 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 22:48:15,690 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-21 22:48:15,690 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 22:48:15,690 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 22:48:15,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:15,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:15,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:15,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:15,756 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 22:48:15,756 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 22:48:15,761 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 22:48:15,761 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 22:48:15,792 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-21 22:48:15,792 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 22:48:15,821 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-21 22:48:15,823 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 22:48:15,823 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 22:48:15,823 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 22:48:15,824 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 22:48:15,824 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-21 22:48:15,824 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-21 22:48:15,824 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 22:48:15,824 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 22:48:15,824 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-21 22:48:15,824 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 22:48:15,824 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 22:48:15,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:15,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:15,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:15,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:15,886 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 22:48:15,887 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-21 22:48:15,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:48:15,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:48:15,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 22:48:15,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:48:15,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:48:15,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:48:15,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 22:48:15,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 22:48:15,892 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-21 22:48:15,894 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-21 22:48:15,894 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-21 22:48:15,894 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-21 22:48:15,894 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-21 22:48:15,894 INFO L518 LassoAnalysis]: Proved termination. [2020-06-21 22:48:15,895 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2020-06-21 22:48:15,895 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-21 22:48:15,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:48:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:15,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-21 22:48:15,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:15,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-21 22:48:15,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:15,946 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-21 22:48:15,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:15,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-21 22:48:15,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:15,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-21 22:48:15,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:15,999 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 7 predicates after loop cannibalization [2020-06-21 22:48:15,999 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2020-06-21 22:48:15,999 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states and 19 transitions. cyclomatic complexity: 6 Second operand 5 states. [2020-06-21 22:48:16,039 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states and 19 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 63 states and 78 transitions. Complement of second has 14 states. [2020-06-21 22:48:16,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-21 22:48:16,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-21 22:48:16,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2020-06-21 22:48:16,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 4 letters. Loop has 6 letters. [2020-06-21 22:48:16,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 22:48:16,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2020-06-21 22:48:16,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 22:48:16,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 4 letters. Loop has 12 letters. [2020-06-21 22:48:16,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 22:48:16,043 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 78 transitions. [2020-06-21 22:48:16,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2020-06-21 22:48:16,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 37 states and 50 transitions. [2020-06-21 22:48:16,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-06-21 22:48:16,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-06-21 22:48:16,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 50 transitions. [2020-06-21 22:48:16,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-21 22:48:16,048 INFO L706 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2020-06-21 22:48:16,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 50 transitions. [2020-06-21 22:48:16,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2020-06-21 22:48:16,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-21 22:48:16,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2020-06-21 22:48:16,052 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 37 transitions. [2020-06-21 22:48:16,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-21 22:48:16,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-06-21 22:48:16,053 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 5 states. [2020-06-21 22:48:16,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-21 22:48:16,068 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2020-06-21 22:48:16,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-21 22:48:16,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 68 transitions. [2020-06-21 22:48:16,071 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-06-21 22:48:16,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 37 states and 51 transitions. [2020-06-21 22:48:16,072 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-06-21 22:48:16,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-06-21 22:48:16,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 51 transitions. [2020-06-21 22:48:16,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-21 22:48:16,073 INFO L706 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-06-21 22:48:16,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 51 transitions. [2020-06-21 22:48:16,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2020-06-21 22:48:16,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-06-21 22:48:16,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2020-06-21 22:48:16,076 INFO L729 BuchiCegarLoop]: Abstraction has 34 states and 46 transitions. [2020-06-21 22:48:16,076 INFO L609 BuchiCegarLoop]: Abstraction has 34 states and 46 transitions. [2020-06-21 22:48:16,076 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-21 22:48:16,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 46 transitions. [2020-06-21 22:48:16,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-06-21 22:48:16,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 22:48:16,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 22:48:16,078 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2020-06-21 22:48:16,078 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 2, 2] [2020-06-21 22:48:16,078 INFO L794 eck$LassoCheckResult]: Stem: 538#ULTIMATE.startENTRY [26] ULTIMATE.startENTRY-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~c~0] 539#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 554#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 555#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 543#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 540#L15-2 [2020-06-21 22:48:16,078 INFO L796 eck$LassoCheckResult]: Loop: 540#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 541#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 559#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 558#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 556#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 547#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 544#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 543#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 540#L15-2 [2020-06-21 22:48:16,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:48:16,079 INFO L82 PathProgramCache]: Analyzing trace with hash 53597887, now seen corresponding path program 5 times [2020-06-21 22:48:16,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:48:16,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:48:16,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:16,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 22:48:16,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:16,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:16,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:48:16,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1415935609, now seen corresponding path program 3 times [2020-06-21 22:48:16,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:48:16,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:48:16,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:16,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 22:48:16,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:16,104 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-21 22:48:16,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-21 22:48:16,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-21 22:48:16,105 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-21 22:48:16,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-21 22:48:16,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-21 22:48:16,106 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. cyclomatic complexity: 14 Second operand 4 states. [2020-06-21 22:48:16,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-21 22:48:16,118 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2020-06-21 22:48:16,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-21 22:48:16,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 49 transitions. [2020-06-21 22:48:16,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-06-21 22:48:16,121 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 32 states and 40 transitions. [2020-06-21 22:48:16,121 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-06-21 22:48:16,121 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-06-21 22:48:16,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 40 transitions. [2020-06-21 22:48:16,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-21 22:48:16,122 INFO L706 BuchiCegarLoop]: Abstraction has 32 states and 40 transitions. [2020-06-21 22:48:16,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 40 transitions. [2020-06-21 22:48:16,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2020-06-21 22:48:16,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-21 22:48:16,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2020-06-21 22:48:16,125 INFO L729 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2020-06-21 22:48:16,125 INFO L609 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2020-06-21 22:48:16,125 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-21 22:48:16,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 37 transitions. [2020-06-21 22:48:16,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-06-21 22:48:16,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 22:48:16,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 22:48:16,126 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2020-06-21 22:48:16,126 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [10, 6, 4] [2020-06-21 22:48:16,127 INFO L794 eck$LassoCheckResult]: Stem: 619#ULTIMATE.startENTRY [26] ULTIMATE.startENTRY-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~c~0] 620#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 639#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 629#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 624#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 621#L15-2 [2020-06-21 22:48:16,127 INFO L796 eck$LassoCheckResult]: Loop: 621#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 615#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 616#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 643#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 642#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 641#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 640#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 638#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 637#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 634#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 636#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 635#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 633#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 632#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 631#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 630#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 628#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 626#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 627#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 623#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 621#L15-2 [2020-06-21 22:48:16,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:48:16,128 INFO L82 PathProgramCache]: Analyzing trace with hash 53597887, now seen corresponding path program 6 times [2020-06-21 22:48:16,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:48:16,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:48:16,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:16,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 22:48:16,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:16,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:48:16,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1241163421, now seen corresponding path program 4 times [2020-06-21 22:48:16,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:48:16,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:48:16,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:16,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 22:48:16,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:16,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:48:16,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1836475681, now seen corresponding path program 5 times [2020-06-21 22:48:16,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:48:16,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:48:16,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:16,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 22:48:16,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:16,198 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 66 proven. 26 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-06-21 22:48:16,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-21 22:48:16,199 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-21 22:48:16,216 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2020-06-21 22:48:16,235 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2020-06-21 22:48:16,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-21 22:48:16,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-21 22:48:16,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:16,311 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 94 proven. 36 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-21 22:48:16,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-21 22:48:16,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11] total 15 [2020-06-21 22:48:16,510 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 72 [2020-06-21 22:48:16,522 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 22:48:16,523 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 22:48:16,523 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 22:48:16,523 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 22:48:16,523 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-21 22:48:16,523 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 22:48:16,523 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 22:48:16,523 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 22:48:16,523 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop [2020-06-21 22:48:16,523 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 22:48:16,523 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 22:48:16,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:16,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:16,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:16,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:16,577 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 22:48:16,577 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 22:48:16,582 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 22:48:16,582 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 22:48:16,608 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-21 22:48:16,609 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 22:48:16,613 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 22:48:16,614 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 22:48:16,640 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-21 22:48:16,640 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 22:48:16,645 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 22:48:16,645 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 22:48:16,674 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-21 22:48:16,674 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 22:48:16,754 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-21 22:48:16,756 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 22:48:16,756 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 22:48:16,756 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 22:48:16,756 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 22:48:16,756 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-21 22:48:16,757 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-21 22:48:16,757 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 22:48:16,757 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 22:48:16,757 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop [2020-06-21 22:48:16,757 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 22:48:16,757 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 22:48:16,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:16,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:16,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:16,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:16,814 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 22:48:16,815 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-21 22:48:16,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:48:16,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:48:16,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 22:48:16,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:48:16,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:48:16,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:48:16,817 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 22:48:16,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 22:48:16,819 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-21 22:48:16,820 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-21 22:48:16,820 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-21 22:48:16,821 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-21 22:48:16,821 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-21 22:48:16,821 INFO L518 LassoAnalysis]: Proved termination. [2020-06-21 22:48:16,821 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2020-06-21 22:48:16,821 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-21 22:48:16,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:48:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:16,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-21 22:48:16,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:16,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-21 22:48:16,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:16,904 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 54 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-06-21 22:48:16,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:16,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-21 22:48:16,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:17,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-21 22:48:17,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:17,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-21 22:48:17,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:17,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:17,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-21 22:48:17,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:17,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-21 22:48:17,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:17,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-21 22:48:17,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:17,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-21 22:48:17,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:17,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-21 22:48:17,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:17,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-21 22:48:17,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:17,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-21 22:48:17,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:17,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-21 22:48:17,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:17,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-21 22:48:17,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:17,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-21 22:48:17,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:17,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-21 22:48:17,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:17,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:17,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-21 22:48:17,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:17,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-21 22:48:17,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:17,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:17,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-21 22:48:17,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:17,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-21 22:48:17,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:17,618 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 20 predicates after loop cannibalization [2020-06-21 22:48:17,618 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 20 loop predicates [2020-06-21 22:48:17,619 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 29 states and 37 transitions. cyclomatic complexity: 10 Second operand 7 states. [2020-06-21 22:48:18,373 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 29 states and 37 transitions. cyclomatic complexity: 10. Second operand 7 states. Result 506 states and 572 transitions. Complement of second has 170 states. [2020-06-21 22:48:18,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 22 states 1 stem states 17 non-accepting loop states 3 accepting loop states [2020-06-21 22:48:18,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-21 22:48:18,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 41 transitions. [2020-06-21 22:48:18,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 41 transitions. Stem has 5 letters. Loop has 20 letters. [2020-06-21 22:48:18,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 22:48:18,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 41 transitions. Stem has 25 letters. Loop has 20 letters. [2020-06-21 22:48:18,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 22:48:18,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 41 transitions. Stem has 5 letters. Loop has 40 letters. [2020-06-21 22:48:18,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 22:48:18,381 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 506 states and 572 transitions. [2020-06-21 22:48:18,392 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2020-06-21 22:48:18,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 506 states to 46 states and 52 transitions. [2020-06-21 22:48:18,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-06-21 22:48:18,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-06-21 22:48:18,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 52 transitions. [2020-06-21 22:48:18,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-21 22:48:18,394 INFO L706 BuchiCegarLoop]: Abstraction has 46 states and 52 transitions. [2020-06-21 22:48:18,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 52 transitions. [2020-06-21 22:48:18,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 25. [2020-06-21 22:48:18,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-21 22:48:18,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2020-06-21 22:48:18,396 INFO L729 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2020-06-21 22:48:18,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-06-21 22:48:18,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2020-06-21 22:48:18,397 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 15 states. [2020-06-21 22:48:18,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-21 22:48:18,588 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2020-06-21 22:48:18,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-06-21 22:48:18,589 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 78 transitions. [2020-06-21 22:48:18,590 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2020-06-21 22:48:18,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 34 states and 39 transitions. [2020-06-21 22:48:18,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-06-21 22:48:18,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-06-21 22:48:18,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 39 transitions. [2020-06-21 22:48:18,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-21 22:48:18,591 INFO L706 BuchiCegarLoop]: Abstraction has 34 states and 39 transitions. [2020-06-21 22:48:18,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 39 transitions. [2020-06-21 22:48:18,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2020-06-21 22:48:18,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-21 22:48:18,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2020-06-21 22:48:18,594 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2020-06-21 22:48:18,594 INFO L609 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2020-06-21 22:48:18,594 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2020-06-21 22:48:18,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. [2020-06-21 22:48:18,595 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2020-06-21 22:48:18,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 22:48:18,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 22:48:18,595 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1] [2020-06-21 22:48:18,595 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [9, 5, 4] [2020-06-21 22:48:18,596 INFO L794 eck$LassoCheckResult]: Stem: 2712#ULTIMATE.startENTRY [26] ULTIMATE.startENTRY-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~c~0] 2713#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 2726#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 2725#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 2724#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 2723#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 2719#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 2718#L15-2 [2020-06-21 22:48:18,596 INFO L796 eck$LassoCheckResult]: Loop: 2718#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 2721#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 2722#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 2729#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 2727#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 2728#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 2714#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 2715#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 2734#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 2732#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 2733#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 2710#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 2711#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 2716#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 2731#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 2730#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 2709#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 2717#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 2718#L15-2 [2020-06-21 22:48:18,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:48:18,597 INFO L82 PathProgramCache]: Analyzing trace with hash -32037150, now seen corresponding path program 7 times [2020-06-21 22:48:18,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:48:18,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:48:18,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:18,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 22:48:18,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:18,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:48:18,606 INFO L82 PathProgramCache]: Analyzing trace with hash -631458422, now seen corresponding path program 5 times [2020-06-21 22:48:18,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:48:18,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:48:18,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:18,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 22:48:18,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:18,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:48:18,619 INFO L82 PathProgramCache]: Analyzing trace with hash 771114539, now seen corresponding path program 6 times [2020-06-21 22:48:18,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:48:18,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:48:18,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:18,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 22:48:18,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:48:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:48:18,778 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2020-06-21 22:48:18,791 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 22:48:18,791 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 22:48:18,791 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 22:48:18,791 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 22:48:18,791 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-21 22:48:18,791 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 22:48:18,792 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 22:48:18,792 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 22:48:18,792 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Loop [2020-06-21 22:48:18,792 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 22:48:18,792 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 22:48:18,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:18,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:18,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:18,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:18,853 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 22:48:18,853 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 22:48:18,857 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 22:48:18,857 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 22:48:18,888 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-21 22:48:18,888 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 22:48:18,957 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-21 22:48:18,959 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 22:48:18,959 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 22:48:18,959 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 22:48:18,959 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 22:48:18,959 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-21 22:48:18,959 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-21 22:48:18,960 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 22:48:18,960 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 22:48:18,960 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Loop [2020-06-21 22:48:18,960 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 22:48:18,960 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 22:48:18,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:18,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:18,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:18,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:48:19,025 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 22:48:19,025 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-21 22:48:19,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:48:19,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:48:19,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 22:48:19,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:48:19,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:48:19,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:48:19,027 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 22:48:19,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 22:48:19,029 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-21 22:48:19,031 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-21 22:48:19,031 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-21 22:48:19,031 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-21 22:48:19,031 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-21 22:48:19,032 INFO L518 LassoAnalysis]: Proved termination. [2020-06-21 22:48:19,032 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2020-06-21 22:48:19,032 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-21 22:48:19,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:48:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:19,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-21 22:48:19,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:19,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:19,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-21 22:48:19,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:19,111 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-06-21 22:48:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:19,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-21 22:48:19,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:19,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-21 22:48:19,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:19,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:19,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-21 22:48:19,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:19,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-21 22:48:19,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:19,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-21 22:48:19,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:19,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-21 22:48:19,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:19,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-21 22:48:19,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:19,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-21 22:48:19,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:19,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:19,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-21 22:48:19,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:19,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-21 22:48:19,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:19,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-21 22:48:19,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:19,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-21 22:48:19,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:19,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:19,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-21 22:48:19,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:19,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-21 22:48:19,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:19,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-21 22:48:19,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:19,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:48:19,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-21 22:48:19,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:48:19,705 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 8 predicates after loop cannibalization [2020-06-21 22:48:19,705 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2020-06-21 22:48:19,705 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 27 states and 30 transitions. cyclomatic complexity: 5 Second operand 8 states. [2020-06-21 22:48:19,793 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 27 states and 30 transitions. cyclomatic complexity: 5. Second operand 8 states. Result 124 states and 147 transitions. Complement of second has 32 states. [2020-06-21 22:48:19,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2020-06-21 22:48:19,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-21 22:48:19,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2020-06-21 22:48:19,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 7 letters. Loop has 18 letters. [2020-06-21 22:48:19,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 22:48:19,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 25 letters. Loop has 18 letters. [2020-06-21 22:48:19,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 22:48:19,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 7 letters. Loop has 36 letters. [2020-06-21 22:48:19,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 22:48:19,796 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 147 transitions. [2020-06-21 22:48:19,798 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-21 22:48:19,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 0 states and 0 transitions. [2020-06-21 22:48:19,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-21 22:48:19,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-21 22:48:19,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-21 22:48:19,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-21 22:48:19,799 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-21 22:48:19,799 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-21 22:48:19,799 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-21 22:48:19,799 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2020-06-21 22:48:19,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-21 22:48:19,799 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-21 22:48:19,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-21 22:48:19,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.06 10:48:19 BasicIcfg [2020-06-21 22:48:19,806 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-21 22:48:19,806 INFO L168 Benchmark]: Toolchain (without parser) took 7463.96 ms. Allocated memory was 649.6 MB in the beginning and 851.4 MB in the end (delta: 201.9 MB). Free memory was 565.2 MB in the beginning and 620.6 MB in the end (delta: -55.4 MB). Peak memory consumption was 146.4 MB. Max. memory is 50.3 GB. [2020-06-21 22:48:19,807 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.7 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-21 22:48:19,808 INFO L168 Benchmark]: CACSL2BoogieTranslator took 284.85 ms. Allocated memory was 649.6 MB in the beginning and 694.7 MB in the end (delta: 45.1 MB). Free memory was 565.2 MB in the beginning and 661.1 MB in the end (delta: -95.9 MB). Peak memory consumption was 30.5 MB. Max. memory is 50.3 GB. [2020-06-21 22:48:19,808 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.03 ms. Allocated memory is still 694.7 MB. Free memory was 661.1 MB in the beginning and 660.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-21 22:48:19,809 INFO L168 Benchmark]: Boogie Preprocessor took 19.64 ms. Allocated memory is still 694.7 MB. Free memory was 660.0 MB in the beginning and 657.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 50.3 GB. [2020-06-21 22:48:19,809 INFO L168 Benchmark]: RCFGBuilder took 212.10 ms. Allocated memory is still 694.7 MB. Free memory was 657.1 MB in the beginning and 643.3 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 50.3 GB. [2020-06-21 22:48:19,810 INFO L168 Benchmark]: BlockEncodingV2 took 77.84 ms. Allocated memory is still 694.7 MB. Free memory was 643.3 MB in the beginning and 638.9 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 50.3 GB. [2020-06-21 22:48:19,810 INFO L168 Benchmark]: TraceAbstraction took 151.60 ms. Allocated memory is still 694.7 MB. Free memory was 638.9 MB in the beginning and 630.3 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 50.3 GB. [2020-06-21 22:48:19,811 INFO L168 Benchmark]: BuchiAutomizer took 6676.83 ms. Allocated memory was 694.7 MB in the beginning and 851.4 MB in the end (delta: 156.8 MB). Free memory was 629.2 MB in the beginning and 620.6 MB in the end (delta: 8.6 MB). Peak memory consumption was 165.4 MB. Max. memory is 50.3 GB. [2020-06-21 22:48:19,815 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 7 locations, 9 edges - StatisticsResult: Encoded RCFG 3 locations, 4 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.7 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 284.85 ms. Allocated memory was 649.6 MB in the beginning and 694.7 MB in the end (delta: 45.1 MB). Free memory was 565.2 MB in the beginning and 661.1 MB in the end (delta: -95.9 MB). Peak memory consumption was 30.5 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 36.03 ms. Allocated memory is still 694.7 MB. Free memory was 661.1 MB in the beginning and 660.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 19.64 ms. Allocated memory is still 694.7 MB. Free memory was 660.0 MB in the beginning and 657.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 50.3 GB. * RCFGBuilder took 212.10 ms. Allocated memory is still 694.7 MB. Free memory was 657.1 MB in the beginning and 643.3 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 77.84 ms. Allocated memory is still 694.7 MB. Free memory was 643.3 MB in the beginning and 638.9 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 50.3 GB. * TraceAbstraction took 151.60 ms. Allocated memory is still 694.7 MB. Free memory was 638.9 MB in the beginning and 630.3 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 6676.83 ms. Allocated memory was 694.7 MB in the beginning and 851.4 MB in the end (delta: 156.8 MB). Free memory was 629.2 MB in the beginning and 620.6 MB in the end (delta: 8.6 MB). Peak memory consumption was 165.4 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: 14]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 3 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=3occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (4 trivial, 0 deterministic, 7 nondeterministic). One nondeterministic module has affine ranking function -2 * n + 211 and consists of 3 locations. One nondeterministic module has affine ranking function -2 * n + 211 and consists of 3 locations. One nondeterministic module has affine ranking function c and consists of 3 locations. One nondeterministic module has affine ranking function -2 * n + 221 and consists of 4 locations. One nondeterministic module has affine ranking function n and consists of 5 locations. One nondeterministic module has affine ranking function c and consists of 22 locations. One nondeterministic module has affine ranking function c and consists of 7 locations. 4 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.6s and 9 iterations. TraceHistogramMax:10. Analysis of lassos took 3.4s. Construction of modules took 0.2s. Büchi inclusion checks took 2.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 54 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 34 states and ocurred in iteration 5. Nontrivial modules had stage [7, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 140/170 HoareTripleCheckerStatistics: 36 SDtfs, 65 SDslu, 23 SDs, 0 SdLazy, 283 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT4 conc0 concLT3 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax162 hnf100 lsp37 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq152 hnf94 smp100 dnf100 smp100 tf112 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-21 22:48:09.116 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-21 22:48:20.049 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check