YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 04:26:56,340 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 04:26:56,342 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 04:26:56,354 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 04:26:56,354 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 04:26:56,355 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 04:26:56,356 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 04:26:56,358 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 04:26:56,359 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 04:26:56,360 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 04:26:56,361 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 04:26:56,361 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 04:26:56,362 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 04:26:56,363 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 04:26:56,364 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 04:26:56,364 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 04:26:56,365 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 04:26:56,367 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 04:26:56,369 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 04:26:56,370 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 04:26:56,371 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 04:26:56,372 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 04:26:56,375 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 04:26:56,375 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 04:26:56,375 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 04:26:56,376 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 04:26:56,376 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 04:26:56,377 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 04:26:56,378 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 04:26:56,378 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 04:26:56,379 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 04:26:56,380 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 04:26:56,381 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 04:26:56,381 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 04:26:56,381 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 04:26:56,382 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 04:26:56,382 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 04:26:56,383 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 04:26:56,383 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 04:26:56,384 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 04:26:56,398 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 04:26:56,398 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 04:26:56,399 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 04:26:56,399 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 04:26:56,399 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 04:26:56,400 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 04:26:56,400 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 04:26:56,400 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 04:26:56,400 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 04:26:56,400 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 04:26:56,400 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 04:26:56,401 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 04:26:56,401 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 04:26:56,401 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 04:26:56,401 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:26:56,401 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 04:26:56,401 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 04:26:56,402 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 04:26:56,402 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 04:26:56,402 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 04:26:56,402 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 04:26:56,402 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 04:26:56,402 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 04:26:56,402 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 04:26:56,403 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 04:26:56,403 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 04:26:56,403 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 04:26:56,403 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 04:26:56,403 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 04:26:56,428 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 04:26:56,441 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 04:26:56,445 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 04:26:56,446 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 04:26:56,447 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 04:26:56,447 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 04:26:56,514 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/147618897fc34ff5b93ae7b7144034e8/FLAG9522a1cdf [2020-06-22 04:26:56,874 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 04:26:56,874 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 04:26:56,881 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/147618897fc34ff5b93ae7b7144034e8/FLAG9522a1cdf [2020-06-22 04:26:57,289 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/147618897fc34ff5b93ae7b7144034e8 [2020-06-22 04:26:57,300 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 04:26:57,302 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 04:26:57,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 04:26:57,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 04:26:57,307 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 04:26:57,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 04:26:57" (1/1) ... [2020-06-22 04:26:57,311 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43c7ebea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:26:57, skipping insertion in model container [2020-06-22 04:26:57,311 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 04:26:57" (1/1) ... [2020-06-22 04:26:57,318 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 04:26:57,336 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 04:26:57,490 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 04:26:57,494 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 04:26:57,564 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 04:26:57,578 INFO L195 MainTranslator]: Completed translation [2020-06-22 04:26:57,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:26:57 WrapperNode [2020-06-22 04:26:57,579 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 04:26:57,580 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 04:26:57,580 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 04:26:57,580 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 04:26:57,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:26:57" (1/1) ... [2020-06-22 04:26:57,594 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:26:57" (1/1) ... [2020-06-22 04:26:57,614 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 04:26:57,615 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 04:26:57,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 04:26:57,615 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 04:26:57,624 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:26:57" (1/1) ... [2020-06-22 04:26:57,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:26:57" (1/1) ... [2020-06-22 04:26:57,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:26:57" (1/1) ... [2020-06-22 04:26:57,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:26:57" (1/1) ... [2020-06-22 04:26:57,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:26:57" (1/1) ... [2020-06-22 04:26:57,632 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:26:57" (1/1) ... [2020-06-22 04:26:57,633 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:26:57" (1/1) ... [2020-06-22 04:26:57,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 04:26:57,634 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 04:26:57,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 04:26:57,635 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 04:26:57,635 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:26:57" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 04:26:57,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 04:26:57,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 04:26:57,841 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 04:26:57,841 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 04:26:57,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:26:57 BoogieIcfgContainer [2020-06-22 04:26:57,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 04:26:57,843 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 04:26:57,844 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 04:26:57,846 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 04:26:57,846 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:26:57" (1/1) ... [2020-06-22 04:26:57,861 INFO L313 BlockEncoder]: Initial Icfg 10 locations, 15 edges [2020-06-22 04:26:57,862 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 04:26:57,863 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 04:26:57,863 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 04:26:57,864 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 04:26:57,866 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 04:26:57,867 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 04:26:57,867 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 04:26:57,883 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 04:26:57,900 INFO L200 BlockEncoder]: SBE split 4 edges [2020-06-22 04:26:57,904 INFO L70 emoveInfeasibleEdges]: Removed 3 edges and 0 locations because of local infeasibility [2020-06-22 04:26:57,906 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 04:26:57,917 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding [2020-06-22 04:26:57,919 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 04:26:57,920 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 04:26:57,920 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 04:26:57,920 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 04:26:57,921 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 04:26:57,921 INFO L313 BlockEncoder]: Encoded RCFG 6 locations, 12 edges [2020-06-22 04:26:57,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 04:26:57 BasicIcfg [2020-06-22 04:26:57,922 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 04:26:57,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 04:26:57,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 04:26:57,926 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 04:26:57,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 04:26:57" (1/4) ... [2020-06-22 04:26:57,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef6c6d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 04:26:57, skipping insertion in model container [2020-06-22 04:26:57,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:26:57" (2/4) ... [2020-06-22 04:26:57,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef6c6d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 04:26:57, skipping insertion in model container [2020-06-22 04:26:57,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:26:57" (3/4) ... [2020-06-22 04:26:57,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef6c6d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 04:26:57, skipping insertion in model container [2020-06-22 04:26:57,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 04:26:57" (4/4) ... [2020-06-22 04:26:57,930 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 04:26:57,940 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 04:26:57,948 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 04:26:57,964 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 04:26:57,992 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 04:26:57,992 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 04:26:57,993 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 04:26:57,993 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 04:26:57,993 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 04:26:57,993 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 04:26:57,993 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 04:26:57,993 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 04:26:57,994 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 04:26:58,007 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2020-06-22 04:26:58,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 04:26:58,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-06-22 04:26:58,067 INFO L451 ceAbstractionStarter]: At program point L18-2(lines 18 20) the Hoare annotation is: true [2020-06-22 04:26:58,067 INFO L448 ceAbstractionStarter]: For program point L18-3(lines 18 20) no Hoare annotation was computed. [2020-06-22 04:26:58,068 INFO L451 ceAbstractionStarter]: At program point L16-2(lines 16 22) the Hoare annotation is: true [2020-06-22 04:26:58,068 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 04:26:58,068 INFO L448 ceAbstractionStarter]: For program point L16-3(lines 16 22) no Hoare annotation was computed. [2020-06-22 04:26:58,068 INFO L451 ceAbstractionStarter]: At program point L14-2(lines 14 24) the Hoare annotation is: true [2020-06-22 04:26:58,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 04:26:58 BasicIcfg [2020-06-22 04:26:58,076 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 04:26:58,077 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 04:26:58,077 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 04:26:58,080 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 04:26:58,081 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:26:58,081 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 04:26:57" (1/5) ... [2020-06-22 04:26:58,082 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6541f3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 04:26:58, skipping insertion in model container [2020-06-22 04:26:58,082 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:26:58,082 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:26:57" (2/5) ... [2020-06-22 04:26:58,083 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6541f3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 04:26:58, skipping insertion in model container [2020-06-22 04:26:58,083 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:26:58,083 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:26:57" (3/5) ... [2020-06-22 04:26:58,083 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6541f3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 04:26:58, skipping insertion in model container [2020-06-22 04:26:58,083 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:26:58,083 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 04:26:57" (4/5) ... [2020-06-22 04:26:58,084 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6541f3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 04:26:58, skipping insertion in model container [2020-06-22 04:26:58,084 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:26:58,084 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 04:26:58" (5/5) ... [2020-06-22 04:26:58,085 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 04:26:58,112 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 04:26:58,112 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 04:26:58,112 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 04:26:58,113 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 04:26:58,113 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 04:26:58,113 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 04:26:58,113 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 04:26:58,113 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 04:26:58,113 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 04:26:58,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-06-22 04:26:58,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 04:26:58,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:26:58,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:26:58,141 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 04:26:58,141 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 04:26:58,142 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 04:26:58,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-06-22 04:26:58,143 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 04:26:58,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:26:58,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:26:58,143 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 04:26:58,143 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 04:26:58,148 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [45] ULTIMATE.startENTRY-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_3 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_3} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4] 6#L14-2true [2020-06-22 04:26:58,149 INFO L796 eck$LassoCheckResult]: Loop: 6#L14-2true [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 8#L16-2true [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 7#L16-3true [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 6#L14-2true [2020-06-22 04:26:58,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:26:58,155 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 1 times [2020-06-22 04:26:58,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:26:58,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:26:58,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:26:58,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:26:58,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:26:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:26:58,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:26:58,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:26:58,217 INFO L82 PathProgramCache]: Analyzing trace with hash 81800, now seen corresponding path program 1 times [2020-06-22 04:26:58,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:26:58,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:26:58,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:26:58,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:26:58,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:26:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:26:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:26:58,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:26:58,244 INFO L82 PathProgramCache]: Analyzing trace with hash 2316125, now seen corresponding path program 1 times [2020-06-22 04:26:58,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:26:58,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:26:58,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:26:58,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:26:58,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:26:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:26:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:26:58,318 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:26:58,320 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:26:58,320 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:26:58,320 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:26:58,320 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:26:58,320 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:26:58,320 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:26:58,321 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:26:58,321 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 04:26:58,321 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:26:58,321 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:26:58,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:26:58,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-22 04:26:58,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-22 04:26:58,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:26:58,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:26:58,441 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:26:58,442 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:26:58,448 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:26:58,448 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:26:58,481 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:26:58,481 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:26:58,501 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:26:58,502 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~y~0=0} Honda state: {ULTIMATE.start_main_~y~0=0} Generalized eigenvectors: [{ULTIMATE.start_main_~y~0=2}, {ULTIMATE.start_main_~y~0=1}, {ULTIMATE.start_main_~y~0=-2}] Lambdas: [1, 1, 1] 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-22 04:26:58,530 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:26:58,530 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:26:58,534 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:26:58,534 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8=0} Honda state: {ULTIMATE.start_main_#t~post8=0} 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-22 04:26:58,561 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:26:58,561 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:26:58,565 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:26:58,565 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post2=0} Honda state: {ULTIMATE.start_main_#t~post2=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-22 04:26:58,592 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:26:58,592 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:26:58,628 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:26:58,628 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:26:58,658 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:26:58,661 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:26:58,661 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:26:58,661 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:26:58,661 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:26:58,661 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:26:58,661 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:26:58,661 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:26:58,662 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:26:58,662 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 04:26:58,662 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:26:58,662 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:26:58,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:26:58,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:26:58,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:26:58,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:26:58,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:26:58,761 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:26:58,767 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:26:58,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:26:58,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:26:58,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:26:58,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:26:58,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:26:58,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:26:58,774 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:26:58,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:26:58,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:26:58,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:26:58,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:26:58,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:26:58,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:26:58,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:26:58,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:26:58,785 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:26:58,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:26:58,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:26:58,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:26:58,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:26:58,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:26:58,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:26:58,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:26:58,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:26:58,788 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:26:58,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:26:58,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:26:58,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:26:58,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:26:58,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:26:58,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:26:58,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:26:58,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:26:58,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:26:58,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:26:58,799 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:26:58,803 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 04:26:58,803 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 04:26:58,805 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:26:58,805 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:26:58,805 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:26:58,806 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2020-06-22 04:26:58,807 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:26:58,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:26:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:26:58,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:26:58,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:26:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:26:58,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 04:26:58,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:26:58,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:26:58,905 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 04:26:58,910 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-22 04:26:58,911 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 6 states. Second operand 3 states. [2020-06-22 04:26:58,991 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 6 states.. Second operand 3 states. Result 20 states and 45 transitions. Complement of second has 6 states. [2020-06-22 04:26:58,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 04:26:58,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 04:26:58,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2020-06-22 04:26:58,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 1 letters. Loop has 3 letters. [2020-06-22 04:26:58,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:26:58,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 4 letters. Loop has 3 letters. [2020-06-22 04:26:58,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:26:58,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 1 letters. Loop has 6 letters. [2020-06-22 04:26:58,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:26:59,005 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 45 transitions. [2020-06-22 04:26:59,007 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-06-22 04:26:59,013 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 17 states and 39 transitions. [2020-06-22 04:26:59,014 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-06-22 04:26:59,014 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-06-22 04:26:59,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 39 transitions. [2020-06-22 04:26:59,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:26:59,015 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 39 transitions. [2020-06-22 04:26:59,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 39 transitions. [2020-06-22 04:26:59,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-06-22 04:26:59,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-06-22 04:26:59,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 35 transitions. [2020-06-22 04:26:59,045 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 35 transitions. [2020-06-22 04:26:59,045 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 35 transitions. [2020-06-22 04:26:59,045 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 04:26:59,046 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 35 transitions. [2020-06-22 04:26:59,047 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-06-22 04:26:59,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:26:59,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:26:59,047 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 04:26:59,047 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 04:26:59,048 INFO L794 eck$LassoCheckResult]: Stem: 70#ULTIMATE.startENTRY [45] ULTIMATE.startENTRY-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_3 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_3} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4] 71#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 75#L16-2 [67] L16-2-->L18-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 72#L18-2 [2020-06-22 04:26:59,048 INFO L796 eck$LassoCheckResult]: Loop: 72#L18-2 [68] L18-2-->L18-3: Formula: (> (+ v_ULTIMATE.start_main_~x~0_11 3) v_ULTIMATE.start_main_~y~0_13) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 66#L18-3 [44] L18-3-->L16-2: Formula: (= v_ULTIMATE.start_main_~y~0_2 (+ v_ULTIMATE.start_main_~y~0_1 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post7] 67#L16-2 [66] L16-2-->L18-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 72#L18-2 [2020-06-22 04:26:59,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:26:59,049 INFO L82 PathProgramCache]: Analyzing trace with hash 74715, now seen corresponding path program 1 times [2020-06-22 04:26:59,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:26:59,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:26:59,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:26:59,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:26:59,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:26:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:26:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:26:59,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:26:59,061 INFO L82 PathProgramCache]: Analyzing trace with hash 96569, now seen corresponding path program 1 times [2020-06-22 04:26:59,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:26:59,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:26:59,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:26:59,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:26:59,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:26:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:26:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:26:59,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:26:59,070 INFO L82 PathProgramCache]: Analyzing trace with hash -2069065953, now seen corresponding path program 1 times [2020-06-22 04:26:59,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:26:59,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:26:59,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:26:59,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:26:59,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:26:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:26:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:26:59,125 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:26:59,125 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:26:59,125 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:26:59,125 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:26:59,126 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:26:59,126 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:26:59,126 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:26:59,126 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:26:59,126 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 04:26:59,126 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:26:59,126 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:26:59,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:26:59,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:26:59,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:26:59,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:26:59,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:26:59,203 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:26:59,203 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:26:59,209 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:26:59,209 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:26:59,214 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:26:59,214 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=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-22 04:26:59,249 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:26:59,249 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:26:59,278 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:26:59,278 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet3=1} Honda state: {ULTIMATE.start_main_#t~nondet3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:26:59,291 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:26:59,291 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:26:59,295 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:26:59,296 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7=0} Honda state: {ULTIMATE.start_main_#t~post7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:26:59,329 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:26:59,329 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:26:59,362 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:26:59,362 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:26:59,683 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:26:59,686 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:26:59,686 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:26:59,686 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:26:59,686 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:26:59,686 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:26:59,686 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:26:59,687 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:26:59,687 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:26:59,687 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 04:26:59,687 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:26:59,687 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:26:59,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:26:59,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:26:59,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:26:59,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-22 04:26:59,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:26:59,754 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:26:59,754 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:26:59,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:26:59,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:26:59,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:26:59,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:26:59,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:26:59,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:26:59,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:26:59,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:26:59,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:26:59,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:26:59,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:26:59,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:26:59,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:26:59,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:26:59,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:26:59,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:26:59,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:26:59,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:26:59,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:26:59,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:26:59,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:26:59,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:26:59,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:26:59,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:26:59,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:26:59,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:26:59,771 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:26:59,777 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 04:26:59,777 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 04:26:59,777 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:26:59,777 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:26:59,778 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:26:59,778 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~y~0 - 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2020-06-22 04:26:59,778 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:26:59,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:26:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:26:59,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:26:59,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:26:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:26:59,817 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 04:26:59,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:26:59,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:26:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:26:59,832 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 04:26:59,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:26:59,850 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 04:26:59,850 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-22 04:26:59,850 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 16 states and 35 transitions. cyclomatic complexity: 22 Second operand 4 states. [2020-06-22 04:26:59,905 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 16 states and 35 transitions. cyclomatic complexity: 22. Second operand 4 states. Result 37 states and 85 transitions. Complement of second has 6 states. [2020-06-22 04:26:59,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 04:26:59,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 04:26:59,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2020-06-22 04:26:59,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 3 letters. Loop has 3 letters. [2020-06-22 04:26:59,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:26:59,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 6 letters. Loop has 3 letters. [2020-06-22 04:26:59,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:26:59,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 3 letters. Loop has 6 letters. [2020-06-22 04:26:59,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:26:59,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 85 transitions. [2020-06-22 04:26:59,912 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2020-06-22 04:26:59,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 33 states and 76 transitions. [2020-06-22 04:26:59,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-06-22 04:26:59,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-06-22 04:26:59,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 76 transitions. [2020-06-22 04:26:59,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:26:59,915 INFO L706 BuchiCegarLoop]: Abstraction has 33 states and 76 transitions. [2020-06-22 04:26:59,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 76 transitions. [2020-06-22 04:26:59,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2020-06-22 04:26:59,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-06-22 04:26:59,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 74 transitions. [2020-06-22 04:26:59,919 INFO L729 BuchiCegarLoop]: Abstraction has 31 states and 74 transitions. [2020-06-22 04:26:59,919 INFO L609 BuchiCegarLoop]: Abstraction has 31 states and 74 transitions. [2020-06-22 04:26:59,919 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 04:26:59,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 74 transitions. [2020-06-22 04:26:59,921 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2020-06-22 04:26:59,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:26:59,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:26:59,921 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 04:26:59,922 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 04:26:59,922 INFO L794 eck$LassoCheckResult]: Stem: 176#ULTIMATE.startENTRY [45] ULTIMATE.startENTRY-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_3 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_3} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4] 177#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 178#L16-2 [66] L16-2-->L18-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 183#L18-2 [2020-06-22 04:26:59,922 INFO L796 eck$LassoCheckResult]: Loop: 183#L18-2 [68] L18-2-->L18-3: Formula: (> (+ v_ULTIMATE.start_main_~x~0_11 3) v_ULTIMATE.start_main_~y~0_13) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 168#L18-3 [44] L18-3-->L16-2: Formula: (= v_ULTIMATE.start_main_~y~0_2 (+ v_ULTIMATE.start_main_~y~0_1 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post7] 169#L16-2 [66] L16-2-->L18-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 183#L18-2 [2020-06-22 04:26:59,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:26:59,923 INFO L82 PathProgramCache]: Analyzing trace with hash 74714, now seen corresponding path program 1 times [2020-06-22 04:26:59,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:26:59,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:26:59,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:26:59,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:26:59,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:26:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:26:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:26:59,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:26:59,933 INFO L82 PathProgramCache]: Analyzing trace with hash 96569, now seen corresponding path program 2 times [2020-06-22 04:26:59,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:26:59,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:26:59,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:26:59,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:26:59,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:26:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:26:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:26:59,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:26:59,939 INFO L82 PathProgramCache]: Analyzing trace with hash -2069095744, now seen corresponding path program 1 times [2020-06-22 04:26:59,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:26:59,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:26:59,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:26:59,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:26:59,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:26:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:26:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:26:59,971 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:26:59,971 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:26:59,971 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:26:59,971 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:26:59,971 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:26:59,971 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:26:59,971 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:26:59,972 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:26:59,972 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 04:26:59,972 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:26:59,972 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:26:59,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-22 04:26:59,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:26:59,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:26:59,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:26:59,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:00,033 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:27:00,034 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:00,037 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:27:00,037 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:27:00,064 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:27:00,065 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet3=1} Honda state: {ULTIMATE.start_main_#t~nondet3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-22 04:27:00,070 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:27:00,070 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:27:00,073 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:27:00,074 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} 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-22 04:27:00,101 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:27:00,101 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:27:00,104 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:27:00,105 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4=0} Honda state: {ULTIMATE.start_main_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:00,132 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:27:00,132 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-22 04:27:00,163 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:27:00,163 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:27:00,462 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:27:00,464 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:27:00,464 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:27:00,465 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:27:00,465 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:27:00,465 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:27:00,465 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:27:00,465 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:27:00,465 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:27:00,465 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 04:27:00,465 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:27:00,465 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:27:00,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:00,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:00,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:00,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:00,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:00,518 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:27:00,518 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:27:00,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:00,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:00,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:00,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:00,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:00,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:00,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:00,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:00,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:27:00,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:00,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:00,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:00,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:00,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:00,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:00,524 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:00,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:00,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:27:00,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:00,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:00,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:00,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:00,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:00,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:00,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:00,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:00,531 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:27:00,536 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 04:27:00,536 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 04:27:00,537 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:27:00,537 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:27:00,537 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:27:00,537 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~y~0) = -1*ULTIMATE.start_main_~x~0 + 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2020-06-22 04:27:00,538 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:27:00,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:00,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:27:00,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:00,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:00,577 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 04:27:00,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:00,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:27:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:00,599 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 04:27:00,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:00,625 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 04:27:00,625 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-22 04:27:00,625 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 31 states and 74 transitions. cyclomatic complexity: 47 Second operand 4 states. [2020-06-22 04:27:00,685 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 31 states and 74 transitions. cyclomatic complexity: 47. Second operand 4 states. Result 79 states and 195 transitions. Complement of second has 6 states. [2020-06-22 04:27:00,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 04:27:00,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 04:27:00,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2020-06-22 04:27:00,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 3 letters. Loop has 3 letters. [2020-06-22 04:27:00,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:27:00,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 6 letters. Loop has 3 letters. [2020-06-22 04:27:00,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:27:00,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 3 letters. Loop has 6 letters. [2020-06-22 04:27:00,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:27:00,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 195 transitions. [2020-06-22 04:27:00,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2020-06-22 04:27:00,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 62 states and 152 transitions. [2020-06-22 04:27:00,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-06-22 04:27:00,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-06-22 04:27:00,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 152 transitions. [2020-06-22 04:27:00,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:27:00,696 INFO L706 BuchiCegarLoop]: Abstraction has 62 states and 152 transitions. [2020-06-22 04:27:00,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 152 transitions. [2020-06-22 04:27:00,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 23. [2020-06-22 04:27:00,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-06-22 04:27:00,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 55 transitions. [2020-06-22 04:27:00,700 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 55 transitions. [2020-06-22 04:27:00,700 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 55 transitions. [2020-06-22 04:27:00,700 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 04:27:00,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 55 transitions. [2020-06-22 04:27:00,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 04:27:00,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:27:00,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:27:00,702 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 04:27:00,702 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 04:27:00,702 INFO L794 eck$LassoCheckResult]: Stem: 335#ULTIMATE.startENTRY [45] ULTIMATE.startENTRY-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_3 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_3} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4] 336#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 337#L16-2 [67] L16-2-->L18-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 331#L18-2 [71] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (< 0 |v_ULTIMATE.start_main_#t~nondet5_5|) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 333#L18-2 [69] L18-2-->L18-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 327#L18-3 [2020-06-22 04:27:00,702 INFO L796 eck$LassoCheckResult]: Loop: 327#L18-3 [44] L18-3-->L16-2: Formula: (= v_ULTIMATE.start_main_~y~0_2 (+ v_ULTIMATE.start_main_~y~0_1 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post7] 328#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 339#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 340#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 344#L16-2 [66] L16-2-->L18-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 343#L18-2 [68] L18-2-->L18-3: Formula: (> (+ v_ULTIMATE.start_main_~x~0_11 3) v_ULTIMATE.start_main_~y~0_13) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 327#L18-3 [2020-06-22 04:27:00,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:00,703 INFO L82 PathProgramCache]: Analyzing trace with hash 71803385, now seen corresponding path program 1 times [2020-06-22 04:27:00,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:27:00,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:27:00,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:00,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:27:00,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:00,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:00,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:00,714 INFO L82 PathProgramCache]: Analyzing trace with hash -2087044618, now seen corresponding path program 1 times [2020-06-22 04:27:00,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:27:00,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:27:00,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:00,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:27:00,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:00,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:00,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:00,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:00,724 INFO L82 PathProgramCache]: Analyzing trace with hash 15630830, now seen corresponding path program 1 times [2020-06-22 04:27:00,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:27:00,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:27:00,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:00,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:27:00,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:00,779 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:27:00,779 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:27:00,780 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:27:00,780 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:27:00,780 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:27:00,780 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:00,780 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:27:00,780 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:27:00,780 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 04:27:00,780 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:27:00,781 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:27:00,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:00,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:00,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:00,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:00,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:00,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:00,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:00,861 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:27:00,861 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:00,865 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:27:00,865 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:27:00,868 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:27:00,868 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post2=0} Honda state: {ULTIMATE.start_main_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-22 04:27:00,895 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:27:00,895 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:27:00,898 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:27:00,898 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4=0} Honda state: {ULTIMATE.start_main_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-22 04:27:00,924 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:27:00,924 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:00,954 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:27:00,954 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:27:01,206 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:27:01,209 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:27:01,209 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:27:01,209 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:27:01,209 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:27:01,210 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:27:01,210 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:27:01,210 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:27:01,210 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:27:01,210 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 04:27:01,210 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:27:01,210 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:27:01,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:01,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:01,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:01,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:01,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:01,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:01,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:01,279 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:27:01,279 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:27:01,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:01,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:01,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:01,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:01,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:01,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:01,281 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:01,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:01,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:27:01,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:01,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:01,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:01,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:01,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:01,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:01,284 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:01,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:01,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:27:01,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:01,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:01,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:01,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:01,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:01,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:01,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:01,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:01,292 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:27:01,296 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 04:27:01,296 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 04:27:01,296 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:27:01,297 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:27:01,297 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:27:01,297 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2020-06-22 04:27:01,297 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:27:01,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:01,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:27:01,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:01,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 04:27:01,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:01,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:27:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:01,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 04:27:01,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:01,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:01,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 04:27:01,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:01,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 04:27:01,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:01,405 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-06-22 04:27:01,406 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2020-06-22 04:27:01,406 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 23 states and 55 transitions. cyclomatic complexity: 35 Second operand 5 states. [2020-06-22 04:27:01,467 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 23 states and 55 transitions. cyclomatic complexity: 35. Second operand 5 states. Result 90 states and 190 transitions. Complement of second has 8 states. [2020-06-22 04:27:01,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 04:27:01,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 04:27:01,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2020-06-22 04:27:01,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 6 letters. [2020-06-22 04:27:01,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:27:01,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 11 letters. Loop has 6 letters. [2020-06-22 04:27:01,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:27:01,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 12 letters. [2020-06-22 04:27:01,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:27:01,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 190 transitions. [2020-06-22 04:27:01,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2020-06-22 04:27:01,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 65 states and 139 transitions. [2020-06-22 04:27:01,476 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-06-22 04:27:01,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-06-22 04:27:01,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 139 transitions. [2020-06-22 04:27:01,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:27:01,476 INFO L706 BuchiCegarLoop]: Abstraction has 65 states and 139 transitions. [2020-06-22 04:27:01,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 139 transitions. [2020-06-22 04:27:01,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 36. [2020-06-22 04:27:01,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-06-22 04:27:01,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 83 transitions. [2020-06-22 04:27:01,480 INFO L729 BuchiCegarLoop]: Abstraction has 36 states and 83 transitions. [2020-06-22 04:27:01,481 INFO L609 BuchiCegarLoop]: Abstraction has 36 states and 83 transitions. [2020-06-22 04:27:01,481 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 04:27:01,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 83 transitions. [2020-06-22 04:27:01,482 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-06-22 04:27:01,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:27:01,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:27:01,482 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 04:27:01,483 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 04:27:01,483 INFO L794 eck$LassoCheckResult]: Stem: 557#ULTIMATE.startENTRY [45] ULTIMATE.startENTRY-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_3 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_3} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4] 558#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 559#L16-2 [67] L16-2-->L18-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 552#L18-2 [71] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (< 0 |v_ULTIMATE.start_main_#t~nondet5_5|) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 553#L18-2 [68] L18-2-->L18-3: Formula: (> (+ v_ULTIMATE.start_main_~x~0_11 3) v_ULTIMATE.start_main_~y~0_13) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 568#L18-3 [2020-06-22 04:27:01,483 INFO L796 eck$LassoCheckResult]: Loop: 568#L18-3 [44] L18-3-->L16-2: Formula: (= v_ULTIMATE.start_main_~y~0_2 (+ v_ULTIMATE.start_main_~y~0_1 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post7] 565#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 562#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 563#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 567#L16-2 [66] L16-2-->L18-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 569#L18-2 [68] L18-2-->L18-3: Formula: (> (+ v_ULTIMATE.start_main_~x~0_11 3) v_ULTIMATE.start_main_~y~0_13) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 568#L18-3 [2020-06-22 04:27:01,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:01,484 INFO L82 PathProgramCache]: Analyzing trace with hash 71803384, now seen corresponding path program 1 times [2020-06-22 04:27:01,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:27:01,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:27:01,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:01,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:27:01,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:01,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:01,494 INFO L82 PathProgramCache]: Analyzing trace with hash -2087044618, now seen corresponding path program 2 times [2020-06-22 04:27:01,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:27:01,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:27:01,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:01,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:27:01,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:01,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:01,503 INFO L82 PathProgramCache]: Analyzing trace with hash -871872851, now seen corresponding path program 1 times [2020-06-22 04:27:01,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:27:01,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:27:01,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:01,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:27:01,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:01,557 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:27:01,558 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:27:01,558 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:27:01,558 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:27:01,558 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:27:01,558 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:01,558 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:27:01,558 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:27:01,558 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-22 04:27:01,558 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:27:01,559 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:27:01,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:01,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:01,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:01,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:01,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:01,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:01,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:01,628 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:27:01,628 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-22 04:27:01,631 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:27:01,631 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-22 04:27:01,661 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:27:01,661 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:27:01,871 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:27:01,873 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:27:01,873 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:27:01,874 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:27:01,874 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:27:01,874 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:27:01,874 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:27:01,874 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:27:01,874 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:27:01,874 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-22 04:27:01,874 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:27:01,874 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:27:01,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:01,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:01,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:01,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:01,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:01,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:01,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:01,935 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:27:01,935 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:27:01,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:01,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:01,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:01,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:01,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:01,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:01,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:01,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:01,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:27:01,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:01,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:01,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:01,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:01,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:01,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:01,940 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:01,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:01,944 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:27:01,947 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 04:27:01,948 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 04:27:01,948 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:27:01,948 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:27:01,948 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:27:01,948 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2020-06-22 04:27:01,949 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:27:01,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:01,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:01,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:27:01,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:01,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 04:27:01,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:02,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:27:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:02,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 04:27:02,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:02,137 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 04:27:02,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:02,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 04:27:02,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:02,235 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 14 predicates after loop cannibalization [2020-06-22 04:27:02,235 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 14 loop predicates [2020-06-22 04:27:02,235 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 36 states and 83 transitions. cyclomatic complexity: 49 Second operand 6 states. [2020-06-22 04:27:02,676 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 36 states and 83 transitions. cyclomatic complexity: 49. Second operand 6 states. Result 727 states and 1451 transitions. Complement of second has 67 states. [2020-06-22 04:27:02,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 11 non-accepting loop states 1 accepting loop states [2020-06-22 04:27:02,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 04:27:02,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2020-06-22 04:27:02,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 66 transitions. Stem has 5 letters. Loop has 6 letters. [2020-06-22 04:27:02,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:27:02,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 66 transitions. Stem has 11 letters. Loop has 6 letters. [2020-06-22 04:27:02,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:27:02,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 66 transitions. Stem has 5 letters. Loop has 12 letters. [2020-06-22 04:27:02,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:27:02,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 727 states and 1451 transitions. [2020-06-22 04:27:02,693 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 279 [2020-06-22 04:27:02,700 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 727 states to 367 states and 709 transitions. [2020-06-22 04:27:02,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2020-06-22 04:27:02,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2020-06-22 04:27:02,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 367 states and 709 transitions. [2020-06-22 04:27:02,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:27:02,701 INFO L706 BuchiCegarLoop]: Abstraction has 367 states and 709 transitions. [2020-06-22 04:27:02,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states and 709 transitions. [2020-06-22 04:27:02,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 118. [2020-06-22 04:27:02,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-06-22 04:27:02,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 274 transitions. [2020-06-22 04:27:02,714 INFO L729 BuchiCegarLoop]: Abstraction has 118 states and 274 transitions. [2020-06-22 04:27:02,714 INFO L609 BuchiCegarLoop]: Abstraction has 118 states and 274 transitions. [2020-06-22 04:27:02,714 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 04:27:02,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 274 transitions. [2020-06-22 04:27:02,715 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 91 [2020-06-22 04:27:02,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:27:02,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:27:02,716 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 04:27:02,717 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 1, 1] [2020-06-22 04:27:02,717 INFO L794 eck$LassoCheckResult]: Stem: 1514#ULTIMATE.startENTRY [45] ULTIMATE.startENTRY-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_3 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_3} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4] 1515#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 1527#L16-2 [67] L16-2-->L18-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 1551#L18-2 [71] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (< 0 |v_ULTIMATE.start_main_#t~nondet5_5|) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 1547#L18-2 [68] L18-2-->L18-3: Formula: (> (+ v_ULTIMATE.start_main_~x~0_11 3) v_ULTIMATE.start_main_~y~0_13) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 1548#L18-3 [2020-06-22 04:27:02,718 INFO L796 eck$LassoCheckResult]: Loop: 1548#L18-3 [44] L18-3-->L16-2: Formula: (= v_ULTIMATE.start_main_~y~0_2 (+ v_ULTIMATE.start_main_~y~0_1 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post7] 1605#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 1602#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 1603#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 1601#L16-2 [66] L16-2-->L18-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 1597#L18-2 [70] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15) (> 0 |v_ULTIMATE.start_main_#t~nondet5_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 1511#L18-2 [69] L18-2-->L18-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 1545#L18-3 [44] L18-3-->L16-2: Formula: (= v_ULTIMATE.start_main_~y~0_2 (+ v_ULTIMATE.start_main_~y~0_1 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post7] 1593#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 1586#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 1587#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 1607#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 1560#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 1558#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 1559#L16-2 [66] L16-2-->L18-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 1553#L18-2 [70] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15) (> 0 |v_ULTIMATE.start_main_#t~nondet5_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 1547#L18-2 [68] L18-2-->L18-3: Formula: (> (+ v_ULTIMATE.start_main_~x~0_11 3) v_ULTIMATE.start_main_~y~0_13) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 1548#L18-3 [2020-06-22 04:27:02,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:02,718 INFO L82 PathProgramCache]: Analyzing trace with hash 71803384, now seen corresponding path program 2 times [2020-06-22 04:27:02,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:27:02,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:27:02,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:02,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:27:02,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:02,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:02,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:02,729 INFO L82 PathProgramCache]: Analyzing trace with hash -99895487, now seen corresponding path program 1 times [2020-06-22 04:27:02,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:27:02,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:27:02,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:02,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:27:02,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:02,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:02,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:02,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1801756118, now seen corresponding path program 1 times [2020-06-22 04:27:02,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:27:02,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:27:02,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:02,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:27:02,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:02,858 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 04:27:02,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 04:27:02,860 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 04:27:02,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:27:02,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:02,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 04:27:02,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:02,933 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-06-22 04:27:02,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 04:27:02,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 10 [2020-06-22 04:27:03,178 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 91 [2020-06-22 04:27:03,194 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:27:03,194 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:27:03,194 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:27:03,194 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:27:03,194 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:27:03,194 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:03,195 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:27:03,195 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:27:03,195 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop [2020-06-22 04:27:03,195 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:27:03,195 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:27:03,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:03,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:03,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:03,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:03,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:03,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:03,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:03,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:03,265 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:27:03,265 INFO L412 LassoAnalysis]: Checking for nontermination... 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-22 04:27:03,270 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:27:03,270 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:27:03,273 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:27:03,274 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8=0} Honda state: {ULTIMATE.start_main_#t~post8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-22 04:27:03,300 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:27:03,300 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:27:03,303 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:27:03,303 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7=0} Honda state: {ULTIMATE.start_main_#t~post7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-22 04:27:03,329 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:27:03,329 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:27:03,332 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:27:03,333 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6=0} Honda state: {ULTIMATE.start_main_#t~post6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:03,360 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:27:03,360 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:03,389 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:27:03,389 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:27:03,771 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:27:03,773 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:27:03,773 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:27:03,773 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:27:03,774 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:27:03,774 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:27:03,774 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:27:03,774 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:27:03,774 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:27:03,774 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop [2020-06-22 04:27:03,774 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:27:03,774 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:27:03,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:03,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:03,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:03,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:03,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:03,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-22 04:27:03,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:03,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:03,851 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:27:03,851 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:27:03,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:03,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:03,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:03,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:03,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:03,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:03,854 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:03,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:03,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:27:03,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:03,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:03,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:03,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:03,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:03,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:03,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:03,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:03,860 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:27:03,862 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 04:27:03,862 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 04:27:03,863 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:27:03,863 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:27:03,863 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:27:03,863 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2020-06-22 04:27:03,863 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:27:03,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:03,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:27:03,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:03,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 04:27:03,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:03,975 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:27:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:04,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 04:27:04,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:04,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 04:27:04,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:04,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 04:27:04,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:04,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 04:27:04,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:04,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 04:27:04,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:04,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 04:27:04,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:04,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 04:27:04,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:04,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 04:27:04,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:04,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 04:27:04,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:04,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:04,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 04:27:04,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:04,439 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 14 predicates after loop cannibalization [2020-06-22 04:27:04,440 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 14 loop predicates [2020-06-22 04:27:04,440 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 118 states and 274 transitions. cyclomatic complexity: 159 Second operand 9 states. [2020-06-22 04:27:05,043 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 118 states and 274 transitions. cyclomatic complexity: 159. Second operand 9 states. Result 4591 states and 9290 transitions. Complement of second has 238 states. [2020-06-22 04:27:05,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 1 stem states 13 non-accepting loop states 2 accepting loop states [2020-06-22 04:27:05,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-06-22 04:27:05,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 108 transitions. [2020-06-22 04:27:05,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 108 transitions. Stem has 5 letters. Loop has 17 letters. [2020-06-22 04:27:05,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:27:05,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 108 transitions. Stem has 22 letters. Loop has 17 letters. [2020-06-22 04:27:05,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:27:05,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 108 transitions. Stem has 5 letters. Loop has 34 letters. [2020-06-22 04:27:05,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:27:05,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4591 states and 9290 transitions. [2020-06-22 04:27:05,123 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 447 [2020-06-22 04:27:05,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4591 states to 849 states and 1669 transitions. [2020-06-22 04:27:05,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2020-06-22 04:27:05,134 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2020-06-22 04:27:05,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 849 states and 1669 transitions. [2020-06-22 04:27:05,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:27:05,134 INFO L706 BuchiCegarLoop]: Abstraction has 849 states and 1669 transitions. [2020-06-22 04:27:05,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states and 1669 transitions. [2020-06-22 04:27:05,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 285. [2020-06-22 04:27:05,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2020-06-22 04:27:05,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 664 transitions. [2020-06-22 04:27:05,156 INFO L729 BuchiCegarLoop]: Abstraction has 285 states and 664 transitions. [2020-06-22 04:27:05,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-06-22 04:27:05,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-06-22 04:27:05,162 INFO L87 Difference]: Start difference. First operand 285 states and 664 transitions. Second operand 10 states. [2020-06-22 04:27:05,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:27:05,292 INFO L93 Difference]: Finished difference Result 332 states and 732 transitions. [2020-06-22 04:27:05,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 04:27:05,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 332 states and 732 transitions. [2020-06-22 04:27:05,302 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 264 [2020-06-22 04:27:05,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 332 states to 328 states and 723 transitions. [2020-06-22 04:27:05,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-06-22 04:27:05,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-06-22 04:27:05,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 328 states and 723 transitions. [2020-06-22 04:27:05,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:27:05,307 INFO L706 BuchiCegarLoop]: Abstraction has 328 states and 723 transitions. [2020-06-22 04:27:05,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states and 723 transitions. [2020-06-22 04:27:05,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 276. [2020-06-22 04:27:05,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2020-06-22 04:27:05,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 640 transitions. [2020-06-22 04:27:05,315 INFO L729 BuchiCegarLoop]: Abstraction has 276 states and 640 transitions. [2020-06-22 04:27:05,316 INFO L609 BuchiCegarLoop]: Abstraction has 276 states and 640 transitions. [2020-06-22 04:27:05,316 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 04:27:05,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 276 states and 640 transitions. [2020-06-22 04:27:05,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 217 [2020-06-22 04:27:05,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:27:05,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:27:05,320 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 04:27:05,320 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 2, 2, 1] [2020-06-22 04:27:05,320 INFO L794 eck$LassoCheckResult]: Stem: 7750#ULTIMATE.startENTRY [45] ULTIMATE.startENTRY-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_3 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_3} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4] 7751#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 7752#L16-2 [67] L16-2-->L18-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 7838#L18-2 [71] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (< 0 |v_ULTIMATE.start_main_#t~nondet5_5|) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 7936#L18-2 [68] L18-2-->L18-3: Formula: (> (+ v_ULTIMATE.start_main_~x~0_11 3) v_ULTIMATE.start_main_~y~0_13) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 7932#L18-3 [2020-06-22 04:27:05,321 INFO L796 eck$LassoCheckResult]: Loop: 7932#L18-3 [44] L18-3-->L16-2: Formula: (= v_ULTIMATE.start_main_~y~0_2 (+ v_ULTIMATE.start_main_~y~0_1 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post7] 7927#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 7859#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 7756#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 7922#L16-2 [66] L16-2-->L18-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 7921#L18-2 [68] L18-2-->L18-3: Formula: (> (+ v_ULTIMATE.start_main_~x~0_11 3) v_ULTIMATE.start_main_~y~0_13) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 7879#L18-3 [44] L18-3-->L16-2: Formula: (= v_ULTIMATE.start_main_~y~0_2 (+ v_ULTIMATE.start_main_~y~0_1 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post7] 7938#L16-2 [66] L16-2-->L18-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 7939#L18-2 [69] L18-2-->L18-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 7965#L18-3 [44] L18-3-->L16-2: Formula: (= v_ULTIMATE.start_main_~y~0_2 (+ v_ULTIMATE.start_main_~y~0_1 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post7] 7959#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 7867#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 7952#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 7953#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 7877#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 7940#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 7941#L16-2 [66] L16-2-->L18-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 7944#L18-2 [70] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15) (> 0 |v_ULTIMATE.start_main_#t~nondet5_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 7744#L18-2 [70] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15) (> 0 |v_ULTIMATE.start_main_#t~nondet5_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 7936#L18-2 [68] L18-2-->L18-3: Formula: (> (+ v_ULTIMATE.start_main_~x~0_11 3) v_ULTIMATE.start_main_~y~0_13) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 7932#L18-3 [2020-06-22 04:27:05,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:05,321 INFO L82 PathProgramCache]: Analyzing trace with hash 71803384, now seen corresponding path program 3 times [2020-06-22 04:27:05,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:27:05,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:27:05,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:05,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:27:05,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:05,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:05,330 INFO L82 PathProgramCache]: Analyzing trace with hash -789507211, now seen corresponding path program 2 times [2020-06-22 04:27:05,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:27:05,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:27:05,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:05,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:27:05,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:05,401 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-06-22 04:27:05,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 04:27:05,401 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 04:27:05,417 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 04:27:05,434 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 04:27:05,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 04:27:05,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 04:27:05,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:05,445 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 25 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-06-22 04:27:05,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 04:27:05,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2020-06-22 04:27:05,471 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 04:27:05,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 04:27:05,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-06-22 04:27:05,472 INFO L87 Difference]: Start difference. First operand 276 states and 640 transitions. cyclomatic complexity: 367 Second operand 9 states. [2020-06-22 04:27:05,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:27:05,579 INFO L93 Difference]: Finished difference Result 551 states and 1089 transitions. [2020-06-22 04:27:05,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 04:27:05,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 551 states and 1089 transitions. [2020-06-22 04:27:05,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 372 [2020-06-22 04:27:05,592 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 551 states to 485 states and 962 transitions. [2020-06-22 04:27:05,592 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-06-22 04:27:05,592 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2020-06-22 04:27:05,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 485 states and 962 transitions. [2020-06-22 04:27:05,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:27:05,593 INFO L706 BuchiCegarLoop]: Abstraction has 485 states and 962 transitions. [2020-06-22 04:27:05,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states and 962 transitions. [2020-06-22 04:27:05,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 371. [2020-06-22 04:27:05,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-06-22 04:27:05,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 784 transitions. [2020-06-22 04:27:05,602 INFO L729 BuchiCegarLoop]: Abstraction has 371 states and 784 transitions. [2020-06-22 04:27:05,602 INFO L609 BuchiCegarLoop]: Abstraction has 371 states and 784 transitions. [2020-06-22 04:27:05,602 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2020-06-22 04:27:05,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 371 states and 784 transitions. [2020-06-22 04:27:05,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 291 [2020-06-22 04:27:05,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:27:05,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:27:05,605 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 04:27:05,605 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 1, 1] [2020-06-22 04:27:05,606 INFO L794 eck$LassoCheckResult]: Stem: 8641#ULTIMATE.startENTRY [45] ULTIMATE.startENTRY-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_3 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_3} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4] 8642#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 8643#L16-2 [67] L16-2-->L18-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 8861#L18-2 [71] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (< 0 |v_ULTIMATE.start_main_#t~nondet5_5|) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 8854#L18-2 [68] L18-2-->L18-3: Formula: (> (+ v_ULTIMATE.start_main_~x~0_11 3) v_ULTIMATE.start_main_~y~0_13) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 8706#L18-3 [2020-06-22 04:27:05,606 INFO L796 eck$LassoCheckResult]: Loop: 8706#L18-3 [44] L18-3-->L16-2: Formula: (= v_ULTIMATE.start_main_~y~0_2 (+ v_ULTIMATE.start_main_~y~0_1 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post7] 8995#L16-2 [66] L16-2-->L18-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 8637#L18-2 [69] L18-2-->L18-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 8638#L18-3 [44] L18-3-->L16-2: Formula: (= v_ULTIMATE.start_main_~y~0_2 (+ v_ULTIMATE.start_main_~y~0_1 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post7] 8959#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 8958#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 8948#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 8947#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 8792#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 8936#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 8937#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 8801#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 8886#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 8887#L16-2 [66] L16-2-->L18-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 8868#L18-2 [70] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15) (> 0 |v_ULTIMATE.start_main_#t~nondet5_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 8863#L18-2 [70] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15) (> 0 |v_ULTIMATE.start_main_#t~nondet5_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 8854#L18-2 [68] L18-2-->L18-3: Formula: (> (+ v_ULTIMATE.start_main_~x~0_11 3) v_ULTIMATE.start_main_~y~0_13) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 8706#L18-3 [2020-06-22 04:27:05,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:05,607 INFO L82 PathProgramCache]: Analyzing trace with hash 71803384, now seen corresponding path program 4 times [2020-06-22 04:27:05,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:27:05,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:27:05,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:05,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:27:05,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:05,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:05,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1075932061, now seen corresponding path program 3 times [2020-06-22 04:27:05,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:27:05,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:27:05,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:05,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:27:05,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:05,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:05,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1517174604, now seen corresponding path program 2 times [2020-06-22 04:27:05,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:27:05,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:27:05,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:05,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:27:05,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:05,701 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 04:27:05,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 04:27:05,701 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 04:27:05,713 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 04:27:05,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 04:27:05,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 04:27:05,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 15 conjunts are in the unsatisfiable core [2020-06-22 04:27:05,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:05,747 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-06-22 04:27:05,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 04:27:05,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 10 [2020-06-22 04:27:05,972 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 92 [2020-06-22 04:27:05,989 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:27:05,990 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:27:05,990 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:27:05,990 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:27:05,990 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:27:05,990 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:05,990 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:27:05,990 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:27:05,990 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Loop [2020-06-22 04:27:05,991 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:27:05,991 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:27:05,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:05,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:05,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:06,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:06,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:06,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:06,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:06,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:06,062 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:27:06,062 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:06,068 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:27:06,069 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:27:06,082 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:27:06,082 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post2=0} Honda state: {ULTIMATE.start_main_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:06,108 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:27:06,108 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:27:06,135 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:27:06,135 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet3=1} Honda state: {ULTIMATE.start_main_#t~nondet3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:06,139 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:27:06,140 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:06,170 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:27:06,170 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:27:06,204 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:27:06,205 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:27:06,206 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:27:06,206 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:27:06,206 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:27:06,206 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:27:06,206 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:27:06,206 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:27:06,206 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:27:06,206 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Loop [2020-06-22 04:27:06,206 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:27:06,206 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:27:06,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:06,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:06,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:06,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:06,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:06,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:06,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:06,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:06,284 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:27:06,284 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:27:06,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:06,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:06,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:06,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:06,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:06,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:06,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:06,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:06,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:27:06,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:06,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:06,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:06,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:06,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:06,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:06,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:06,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:06,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:27:06,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:06,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:06,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:06,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:06,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:06,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:06,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:06,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:06,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:27:06,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:06,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:06,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:06,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:06,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:06,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:06,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:06,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:06,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:27:06,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:06,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:06,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:06,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:06,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:06,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:06,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:06,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:06,298 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:27:06,301 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 04:27:06,302 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-22 04:27:06,302 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:27:06,302 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:27:06,302 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:27:06,303 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2020-06-22 04:27:06,303 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:27:06,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:06,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:27:06,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:06,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 04:27:06,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:06,433 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 04:27:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:06,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 04:27:06,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:06,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 04:27:06,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:06,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:06,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 04:27:06,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:06,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 04:27:06,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:06,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 04:27:06,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:06,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 04:27:06,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:06,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 04:27:06,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:06,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:06,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 04:27:06,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:06,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 15 conjunts are in the unsatisfiable core [2020-06-22 04:27:06,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:06,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 15 conjunts are in the unsatisfiable core [2020-06-22 04:27:06,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:07,057 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 22 predicates after loop cannibalization [2020-06-22 04:27:07,057 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 22 loop predicates [2020-06-22 04:27:07,058 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 371 states and 784 transitions. cyclomatic complexity: 416 Second operand 11 states. [2020-06-22 04:27:08,887 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 371 states and 784 transitions. cyclomatic complexity: 416. Second operand 11 states. Result 32305 states and 55372 transitions. Complement of second has 2321 states. [2020-06-22 04:27:08,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 39 states 1 stem states 33 non-accepting loop states 4 accepting loop states [2020-06-22 04:27:08,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 04:27:08,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 185 transitions. [2020-06-22 04:27:08,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 185 transitions. Stem has 5 letters. Loop has 17 letters. [2020-06-22 04:27:08,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:27:08,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 185 transitions. Stem has 22 letters. Loop has 17 letters. [2020-06-22 04:27:08,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:27:08,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 185 transitions. Stem has 5 letters. Loop has 34 letters. [2020-06-22 04:27:08,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:27:08,892 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32305 states and 55372 transitions. [2020-06-22 04:27:09,125 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1652 [2020-06-22 04:27:09,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32305 states to 3343 states and 5799 transitions. [2020-06-22 04:27:09,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2020-06-22 04:27:09,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2020-06-22 04:27:09,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3343 states and 5799 transitions. [2020-06-22 04:27:09,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:27:09,152 INFO L706 BuchiCegarLoop]: Abstraction has 3343 states and 5799 transitions. [2020-06-22 04:27:09,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3343 states and 5799 transitions. [2020-06-22 04:27:09,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3343 to 549. [2020-06-22 04:27:09,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2020-06-22 04:27:09,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1158 transitions. [2020-06-22 04:27:09,182 INFO L729 BuchiCegarLoop]: Abstraction has 549 states and 1158 transitions. [2020-06-22 04:27:09,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-06-22 04:27:09,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-06-22 04:27:09,183 INFO L87 Difference]: Start difference. First operand 549 states and 1158 transitions. Second operand 10 states. [2020-06-22 04:27:09,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:27:09,308 INFO L93 Difference]: Finished difference Result 727 states and 1422 transitions. [2020-06-22 04:27:09,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-06-22 04:27:09,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 727 states and 1422 transitions. [2020-06-22 04:27:09,314 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 478 [2020-06-22 04:27:09,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 727 states to 659 states and 1332 transitions. [2020-06-22 04:27:09,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2020-06-22 04:27:09,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2020-06-22 04:27:09,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 659 states and 1332 transitions. [2020-06-22 04:27:09,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:27:09,319 INFO L706 BuchiCegarLoop]: Abstraction has 659 states and 1332 transitions. [2020-06-22 04:27:09,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states and 1332 transitions. [2020-06-22 04:27:09,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 510. [2020-06-22 04:27:09,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2020-06-22 04:27:09,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 1082 transitions. [2020-06-22 04:27:09,330 INFO L729 BuchiCegarLoop]: Abstraction has 510 states and 1082 transitions. [2020-06-22 04:27:09,330 INFO L609 BuchiCegarLoop]: Abstraction has 510 states and 1082 transitions. [2020-06-22 04:27:09,330 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2020-06-22 04:27:09,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 510 states and 1082 transitions. [2020-06-22 04:27:09,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 425 [2020-06-22 04:27:09,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:27:09,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:27:09,333 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 04:27:09,333 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 2, 2, 1, 1] [2020-06-22 04:27:09,333 INFO L794 eck$LassoCheckResult]: Stem: 45644#ULTIMATE.startENTRY [45] ULTIMATE.startENTRY-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_3 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_3} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4] 45645#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 45646#L16-2 [67] L16-2-->L18-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 45639#L18-2 [71] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (< 0 |v_ULTIMATE.start_main_#t~nondet5_5|) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 45641#L18-2 [68] L18-2-->L18-3: Formula: (> (+ v_ULTIMATE.start_main_~x~0_11 3) v_ULTIMATE.start_main_~y~0_13) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 45712#L18-3 [2020-06-22 04:27:09,334 INFO L796 eck$LassoCheckResult]: Loop: 45712#L18-3 [44] L18-3-->L16-2: Formula: (= v_ULTIMATE.start_main_~y~0_2 (+ v_ULTIMATE.start_main_~y~0_1 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post7] 45938#L16-2 [66] L16-2-->L18-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 45932#L18-2 [69] L18-2-->L18-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 45933#L18-3 [44] L18-3-->L16-2: Formula: (= v_ULTIMATE.start_main_~y~0_2 (+ v_ULTIMATE.start_main_~y~0_1 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post7] 46125#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 46124#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 46123#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 46122#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 45799#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 46121#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 46120#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 45898#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 45899#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 45893#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 45805#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 46024#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 46025#L16-2 [66] L16-2-->L18-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 46030#L18-2 [70] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15) (> 0 |v_ULTIMATE.start_main_#t~nondet5_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 46063#L18-2 [70] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15) (> 0 |v_ULTIMATE.start_main_#t~nondet5_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 46065#L18-2 [70] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15) (> 0 |v_ULTIMATE.start_main_#t~nondet5_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 45641#L18-2 [68] L18-2-->L18-3: Formula: (> (+ v_ULTIMATE.start_main_~x~0_11 3) v_ULTIMATE.start_main_~y~0_13) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 45712#L18-3 [2020-06-22 04:27:09,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:09,334 INFO L82 PathProgramCache]: Analyzing trace with hash 71803384, now seen corresponding path program 5 times [2020-06-22 04:27:09,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:27:09,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:27:09,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:09,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:27:09,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:09,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:09,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:09,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:09,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1512626466, now seen corresponding path program 4 times [2020-06-22 04:27:09,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:27:09,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:27:09,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:09,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:27:09,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:09,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:09,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:09,357 INFO L82 PathProgramCache]: Analyzing trace with hash 2108090251, now seen corresponding path program 3 times [2020-06-22 04:27:09,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:27:09,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:27:09,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:09,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:27:09,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:09,436 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 32 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 04:27:09,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 04:27:09,437 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 04:27:09,447 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2020-06-22 04:27:09,467 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-06-22 04:27:09,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 04:27:09,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 22 conjunts are in the unsatisfiable core [2020-06-22 04:27:09,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:09,482 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 32 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 04:27:09,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 04:27:09,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2020-06-22 04:27:09,804 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 115 [2020-06-22 04:27:09,821 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:27:09,821 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:27:09,821 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:27:09,821 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:27:09,821 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:27:09,821 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:09,821 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:27:09,822 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:27:09,822 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration9_Loop [2020-06-22 04:27:09,822 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:27:09,822 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:27:09,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:09,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:09,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:09,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:09,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:09,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:09,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:09,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:09,890 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:27:09,890 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:09,893 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:27:09,893 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:27:09,896 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:27:09,896 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post2=0} Honda state: {ULTIMATE.start_main_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:09,922 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:27:09,922 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:27:09,925 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:27:09,925 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4=0} Honda state: {ULTIMATE.start_main_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:09,951 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:27:09,951 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:27:09,954 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:27:09,954 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6=0} Honda state: {ULTIMATE.start_main_#t~post6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:09,979 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:27:09,980 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:27:09,983 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:27:09,983 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7=0} Honda state: {ULTIMATE.start_main_#t~post7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:10,008 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:27:10,009 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:27:10,012 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:27:10,012 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8=0} Honda state: {ULTIMATE.start_main_#t~post8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:10,038 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:27:10,038 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:27:10,064 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:27:10,064 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet3=1} Honda state: {ULTIMATE.start_main_#t~nondet3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:10,087 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:27:10,087 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:27:10,091 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:27:10,091 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:10,117 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:27:10,117 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:10,146 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:27:10,146 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:27:10,505 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:27:10,507 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:27:10,507 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:27:10,507 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:27:10,508 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:27:10,508 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:27:10,508 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:27:10,508 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:27:10,508 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:27:10,508 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration9_Loop [2020-06-22 04:27:10,508 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:27:10,508 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:27:10,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:10,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:10,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:10,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:10,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:10,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:10,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:10,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:10,573 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:27:10,573 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:27:10,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:10,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:10,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:10,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:10,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:10,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:10,575 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:10,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:10,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:27:10,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:10,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:10,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:10,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:10,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:10,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:10,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:10,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:10,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:27:10,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:10,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:10,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:10,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:10,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:10,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:10,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:10,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:10,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:27:10,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:10,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:10,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:10,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:10,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:10,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:10,581 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:10,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:10,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:27:10,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:10,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:10,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:10,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:10,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:10,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:10,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:10,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:10,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:27:10,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:10,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:10,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:10,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:10,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:10,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:10,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:10,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:10,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:27:10,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:10,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:10,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:10,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:10,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:10,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:10,587 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:10,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:10,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:27:10,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:10,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:10,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:10,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:10,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:10,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:10,589 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:10,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:10,592 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:27:10,594 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 04:27:10,595 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-22 04:27:10,595 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:27:10,595 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:27:10,595 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:27:10,595 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2020-06-22 04:27:10,596 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:27:10,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:10,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:27:10,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:10,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2020-06-22 04:27:10,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:10,820 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 35 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:27:10,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:10,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 26 conjunts are in the unsatisfiable core [2020-06-22 04:27:10,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:11,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 26 conjunts are in the unsatisfiable core [2020-06-22 04:27:11,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:11,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2020-06-22 04:27:11,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:11,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 26 conjunts are in the unsatisfiable core [2020-06-22 04:27:11,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:12,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2020-06-22 04:27:12,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:12,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2020-06-22 04:27:12,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:12,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2020-06-22 04:27:12,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:13,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 26 conjunts are in the unsatisfiable core [2020-06-22 04:27:13,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:13,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2020-06-22 04:27:13,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:14,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 27 conjunts are in the unsatisfiable core [2020-06-22 04:27:14,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:14,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 27 conjunts are in the unsatisfiable core [2020-06-22 04:27:14,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:14,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 18 conjunts are in the unsatisfiable core [2020-06-22 04:27:14,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:15,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 18 conjunts are in the unsatisfiable core [2020-06-22 04:27:15,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:15,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:15,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 18 conjunts are in the unsatisfiable core [2020-06-22 04:27:15,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:15,820 INFO L98 LoopCannibalizer]: 21 predicates before loop cannibalization 78 predicates after loop cannibalization [2020-06-22 04:27:15,820 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 78 loop predicates [2020-06-22 04:27:15,820 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 510 states and 1082 transitions. cyclomatic complexity: 575 Second operand 17 states. [2020-06-22 04:27:49,590 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 510 states and 1082 transitions. cyclomatic complexity: 575. Second operand 17 states. Result 90888 states and 150226 transitions. Complement of second has 6584 states. [2020-06-22 04:27:49,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 229 states 1 stem states 223 non-accepting loop states 4 accepting loop states [2020-06-22 04:27:49,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 04:27:49,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 711 transitions. [2020-06-22 04:27:49,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 229 states and 711 transitions. Stem has 5 letters. Loop has 21 letters. [2020-06-22 04:27:49,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:27:49,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 229 states and 711 transitions. Stem has 26 letters. Loop has 21 letters. [2020-06-22 04:27:49,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:27:49,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 229 states and 711 transitions. Stem has 5 letters. Loop has 42 letters. [2020-06-22 04:27:49,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:27:49,599 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90888 states and 150226 transitions. [2020-06-22 04:27:49,970 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2020-06-22 04:27:49,970 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90888 states to 56 states and 99 transitions. [2020-06-22 04:27:49,988 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-06-22 04:27:49,988 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2020-06-22 04:27:49,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 99 transitions. [2020-06-22 04:27:49,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:27:49,989 INFO L706 BuchiCegarLoop]: Abstraction has 56 states and 99 transitions. [2020-06-22 04:27:49,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 99 transitions. [2020-06-22 04:27:49,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-06-22 04:27:49,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-06-22 04:27:49,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 99 transitions. [2020-06-22 04:27:49,991 INFO L729 BuchiCegarLoop]: Abstraction has 56 states and 99 transitions. [2020-06-22 04:27:49,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-06-22 04:27:49,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-06-22 04:27:49,991 INFO L87 Difference]: Start difference. First operand 56 states and 99 transitions. Second operand 12 states. [2020-06-22 04:27:50,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:27:50,102 INFO L93 Difference]: Finished difference Result 142 states and 236 transitions. [2020-06-22 04:27:50,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-06-22 04:27:50,109 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 236 transitions. [2020-06-22 04:27:50,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-06-22 04:27:50,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 122 states and 205 transitions. [2020-06-22 04:27:50,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-06-22 04:27:50,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2020-06-22 04:27:50,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 205 transitions. [2020-06-22 04:27:50,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:27:50,111 INFO L706 BuchiCegarLoop]: Abstraction has 122 states and 205 transitions. [2020-06-22 04:27:50,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 205 transitions. [2020-06-22 04:27:50,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 72. [2020-06-22 04:27:50,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-06-22 04:27:50,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 127 transitions. [2020-06-22 04:27:50,113 INFO L729 BuchiCegarLoop]: Abstraction has 72 states and 127 transitions. [2020-06-22 04:27:50,113 INFO L609 BuchiCegarLoop]: Abstraction has 72 states and 127 transitions. [2020-06-22 04:27:50,113 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2020-06-22 04:27:50,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 127 transitions. [2020-06-22 04:27:50,114 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2020-06-22 04:27:50,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:27:50,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:27:50,114 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 04:27:50,114 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:27:50,115 INFO L794 eck$LassoCheckResult]: Stem: 145399#ULTIMATE.startENTRY [45] ULTIMATE.startENTRY-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_3 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_3} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4] 145400#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 145406#L16-2 [67] L16-2-->L18-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 145401#L18-2 [71] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (< 0 |v_ULTIMATE.start_main_#t~nondet5_5|) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 145403#L18-2 [69] L18-2-->L18-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 145395#L18-3 [2020-06-22 04:27:50,115 INFO L796 eck$LassoCheckResult]: Loop: 145395#L18-3 [44] L18-3-->L16-2: Formula: (= v_ULTIMATE.start_main_~y~0_2 (+ v_ULTIMATE.start_main_~y~0_1 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post7] 145396#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 145423#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 145421#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 145422#L16-2 [66] L16-2-->L18-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 145418#L18-2 [70] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15) (> 0 |v_ULTIMATE.start_main_#t~nondet5_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 145403#L18-2 [69] L18-2-->L18-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 145395#L18-3 [2020-06-22 04:27:50,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:50,115 INFO L82 PathProgramCache]: Analyzing trace with hash 71803385, now seen corresponding path program 2 times [2020-06-22 04:27:50,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:27:50,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:27:50,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:50,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:27:50,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:50,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:50,123 INFO L82 PathProgramCache]: Analyzing trace with hash -273873587, now seen corresponding path program 1 times [2020-06-22 04:27:50,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:27:50,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:27:50,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:50,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:27:50,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:50,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:50,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:50,129 INFO L82 PathProgramCache]: Analyzing trace with hash 484555861, now seen corresponding path program 1 times [2020-06-22 04:27:50,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:27:50,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:27:50,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:50,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:27:50,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:50,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:50,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:50,220 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:27:50,220 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:27:50,220 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:27:50,220 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:27:50,220 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:27:50,221 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:50,221 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:27:50,221 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:27:50,221 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Loop [2020-06-22 04:27:50,221 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:27:50,221 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:27:50,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:50,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:50,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:50,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:50,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:50,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:50,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:50,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:50,277 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:27:50,277 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:50,281 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:27:50,281 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:27:50,284 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:27:50,285 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post2=0} Honda state: {ULTIMATE.start_main_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:50,310 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:27:50,310 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:27:50,314 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:27:50,314 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet3=0} Honda state: {ULTIMATE.start_main_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:50,339 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:27:50,339 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:27:50,343 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:27:50,343 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8=0} Honda state: {ULTIMATE.start_main_#t~post8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:50,369 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:27:50,369 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:27:50,395 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:27:50,396 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=-1} Honda state: {ULTIMATE.start_main_#t~nondet5=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:50,399 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:27:50,399 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:50,428 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:27:50,428 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:27:50,525 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:27:50,527 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:27:50,527 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:27:50,527 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:27:50,527 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:27:50,527 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:27:50,527 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:27:50,527 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:27:50,528 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:27:50,528 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Loop [2020-06-22 04:27:50,528 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:27:50,528 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:27:50,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-22 04:27:50,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:50,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:50,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:50,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:50,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:50,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:50,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:50,585 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:27:50,585 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:27:50,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:50,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:50,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:50,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:50,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:50,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:50,587 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:50,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:50,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:27:50,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:50,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:50,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:50,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:50,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:50,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:50,589 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:50,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:50,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:27:50,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:50,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:50,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:50,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:50,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:50,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:50,591 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:50,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:50,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:27:50,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:50,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:50,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:50,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:50,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:50,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:50,594 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:50,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:50,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:27:50,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:50,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:50,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:50,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:50,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:50,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:50,596 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:50,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:50,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:27:50,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:50,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:50,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:50,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:50,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:50,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:50,597 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:50,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:50,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:27:50,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:50,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:50,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:50,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:50,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:50,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:50,600 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:50,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:50,602 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:27:50,603 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 04:27:50,603 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 04:27:50,604 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:27:50,604 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:27:50,604 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:27:50,604 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2020-06-22 04:27:50,604 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:27:50,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:50,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:27:50,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:50,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 04:27:50,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:50,696 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-22 04:27:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:50,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 04:27:50,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:50,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 04:27:50,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:51,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 04:27:51,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:51,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 04:27:51,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:51,084 INFO L98 LoopCannibalizer]: 9 predicates before loop cannibalization 18 predicates after loop cannibalization [2020-06-22 04:27:51,084 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 18 loop predicates [2020-06-22 04:27:51,084 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 72 states and 127 transitions. cyclomatic complexity: 57 Second operand 7 states. [2020-06-22 04:27:51,772 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 72 states and 127 transitions. cyclomatic complexity: 57. Second operand 7 states. Result 1443 states and 2445 transitions. Complement of second has 154 states. [2020-06-22 04:27:51,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 1 stem states 16 non-accepting loop states 1 accepting loop states [2020-06-22 04:27:51,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 04:27:51,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 86 transitions. [2020-06-22 04:27:51,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 86 transitions. Stem has 5 letters. Loop has 7 letters. [2020-06-22 04:27:51,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:27:51,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 86 transitions. Stem has 12 letters. Loop has 7 letters. [2020-06-22 04:27:51,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:27:51,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 86 transitions. Stem has 5 letters. Loop has 14 letters. [2020-06-22 04:27:51,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:27:51,775 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1443 states and 2445 transitions. [2020-06-22 04:27:51,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 326 [2020-06-22 04:27:51,783 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1443 states to 476 states and 842 transitions. [2020-06-22 04:27:51,783 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-06-22 04:27:51,783 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-06-22 04:27:51,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 476 states and 842 transitions. [2020-06-22 04:27:51,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:27:51,783 INFO L706 BuchiCegarLoop]: Abstraction has 476 states and 842 transitions. [2020-06-22 04:27:51,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states and 842 transitions. [2020-06-22 04:27:51,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 160. [2020-06-22 04:27:51,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2020-06-22 04:27:51,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 308 transitions. [2020-06-22 04:27:51,789 INFO L729 BuchiCegarLoop]: Abstraction has 160 states and 308 transitions. [2020-06-22 04:27:51,789 INFO L609 BuchiCegarLoop]: Abstraction has 160 states and 308 transitions. [2020-06-22 04:27:51,789 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2020-06-22 04:27:51,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 160 states and 308 transitions. [2020-06-22 04:27:51,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 100 [2020-06-22 04:27:51,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:27:51,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:27:51,791 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 04:27:51,791 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2] [2020-06-22 04:27:51,791 INFO L794 eck$LassoCheckResult]: Stem: 147242#ULTIMATE.startENTRY [45] ULTIMATE.startENTRY-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_3 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_3} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4] 147243#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 147244#L16-2 [67] L16-2-->L18-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 147265#L18-2 [71] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (< 0 |v_ULTIMATE.start_main_#t~nondet5_5|) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 147266#L18-2 [69] L18-2-->L18-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 147233#L18-3 [2020-06-22 04:27:51,791 INFO L796 eck$LassoCheckResult]: Loop: 147233#L18-3 [44] L18-3-->L16-2: Formula: (= v_ULTIMATE.start_main_~y~0_2 (+ v_ULTIMATE.start_main_~y~0_1 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post7] 147234#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 147360#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 147362#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 147359#L16-2 [66] L16-2-->L18-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 147358#L18-2 [70] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15) (> 0 |v_ULTIMATE.start_main_#t~nondet5_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 147239#L18-2 [70] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15) (> 0 |v_ULTIMATE.start_main_#t~nondet5_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 147348#L18-2 [69] L18-2-->L18-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 147327#L18-3 [44] L18-3-->L16-2: Formula: (= v_ULTIMATE.start_main_~y~0_2 (+ v_ULTIMATE.start_main_~y~0_1 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post7] 147320#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 147321#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 147312#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 147313#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 147308#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 147306#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 147307#L16-2 [66] L16-2-->L18-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 147332#L18-2 [70] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15) (> 0 |v_ULTIMATE.start_main_#t~nondet5_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 147329#L18-2 [69] L18-2-->L18-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 147233#L18-3 [2020-06-22 04:27:51,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:51,792 INFO L82 PathProgramCache]: Analyzing trace with hash 71803385, now seen corresponding path program 3 times [2020-06-22 04:27:51,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:27:51,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:27:51,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:51,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:27:51,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:51,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:51,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:51,798 INFO L82 PathProgramCache]: Analyzing trace with hash 579443244, now seen corresponding path program 2 times [2020-06-22 04:27:51,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:27:51,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:27:51,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:51,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:27:51,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:51,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:51,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:51,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1483100636, now seen corresponding path program 2 times [2020-06-22 04:27:51,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:27:51,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:27:51,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:51,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:27:51,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:52,037 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 99 [2020-06-22 04:27:52,050 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:27:52,050 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:27:52,050 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:27:52,050 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:27:52,050 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:27:52,050 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:52,050 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:27:52,050 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:27:52,050 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration11_Loop [2020-06-22 04:27:52,051 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:27:52,051 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:27:52,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:52,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:52,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:52,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:52,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:52,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:52,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:52,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:52,109 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:27:52,109 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:52,112 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:27:52,112 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:27:52,115 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:27:52,115 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4=0} Honda state: {ULTIMATE.start_main_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:52,141 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:27:52,141 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:27:52,144 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:27:52,144 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8=0} Honda state: {ULTIMATE.start_main_#t~post8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:52,170 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:27:52,170 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:27:52,173 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:27:52,173 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6=0} Honda state: {ULTIMATE.start_main_#t~post6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:52,198 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:27:52,199 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:27:52,202 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:27:52,202 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7=0} Honda state: {ULTIMATE.start_main_#t~post7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:52,227 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:27:52,228 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:27:52,231 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:27:52,231 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet3=0} Honda state: {ULTIMATE.start_main_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:52,257 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:27:52,257 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:27:52,283 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:27:52,283 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=-1} Honda state: {ULTIMATE.start_main_#t~nondet5=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:52,286 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:27:52,287 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:27:52,290 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:27:52,290 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post2=0} Honda state: {ULTIMATE.start_main_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:52,316 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:27:52,316 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:52,345 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:27:52,345 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:27:52,598 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:27:52,600 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:27:52,600 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:27:52,600 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:27:52,601 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:27:52,601 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:27:52,601 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:27:52,601 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:27:52,601 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:27:52,601 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration11_Loop [2020-06-22 04:27:52,601 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:27:52,601 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:27:52,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:52,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:52,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:52,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:52,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:52,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-22 04:27:52,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:52,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:27:52,665 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:27:52,665 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:27:52,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:52,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:52,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:52,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:52,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:52,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:52,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:52,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:52,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:27:52,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:52,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:52,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:52,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:52,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:52,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:52,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:52,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:52,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:27:52,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:52,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:52,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:52,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:52,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:52,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:52,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:52,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:52,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:27:52,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:52,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:52,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:52,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:52,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:52,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:52,673 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:52,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:52,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:27:52,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:52,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:52,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:52,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:52,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:52,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:52,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:52,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:52,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:27:52,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:52,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:52,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:52,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:52,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:52,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:52,676 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:52,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:52,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:27:52,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:52,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:52,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:52,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:52,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:52,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:52,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:52,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:52,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:27:52,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:27:52,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:27:52,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:27:52,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:27:52,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:27:52,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:27:52,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:27:52,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:27:52,682 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:27:52,683 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 04:27:52,684 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 04:27:52,684 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:27:52,684 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:27:52,684 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:27:52,684 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2020-06-22 04:27:52,685 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:27:52,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:52,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:27:52,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:52,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 20 conjunts are in the unsatisfiable core [2020-06-22 04:27:52,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:52,884 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 26 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:27:52,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:52,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 22 conjunts are in the unsatisfiable core [2020-06-22 04:27:52,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:53,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 22 conjunts are in the unsatisfiable core [2020-06-22 04:27:53,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:53,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 20 conjunts are in the unsatisfiable core [2020-06-22 04:27:53,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:53,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 20 conjunts are in the unsatisfiable core [2020-06-22 04:27:53,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:53,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 21 conjunts are in the unsatisfiable core [2020-06-22 04:27:53,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:53,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 21 conjunts are in the unsatisfiable core [2020-06-22 04:27:53,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:53,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 22 conjunts are in the unsatisfiable core [2020-06-22 04:27:53,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:53,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 21 conjunts are in the unsatisfiable core [2020-06-22 04:27:53,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:54,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 22 conjunts are in the unsatisfiable core [2020-06-22 04:27:54,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:54,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 23 conjunts are in the unsatisfiable core [2020-06-22 04:27:54,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:54,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 23 conjunts are in the unsatisfiable core [2020-06-22 04:27:54,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:54,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 20 conjunts are in the unsatisfiable core [2020-06-22 04:27:54,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:54,831 INFO L98 LoopCannibalizer]: 17 predicates before loop cannibalization 51 predicates after loop cannibalization [2020-06-22 04:27:54,832 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 51 loop predicates [2020-06-22 04:27:54,832 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 160 states and 308 transitions. cyclomatic complexity: 152 Second operand 15 states. [2020-06-22 04:28:01,971 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 160 states and 308 transitions. cyclomatic complexity: 152. Second operand 15 states. Result 148783 states and 228328 transitions. Complement of second has 19154 states. [2020-06-22 04:28:01,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 60 states 1 stem states 58 non-accepting loop states 1 accepting loop states [2020-06-22 04:28:01,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-06-22 04:28:01,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 235 transitions. [2020-06-22 04:28:01,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 235 transitions. Stem has 5 letters. Loop has 18 letters. [2020-06-22 04:28:01,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:28:01,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 235 transitions. Stem has 23 letters. Loop has 18 letters. [2020-06-22 04:28:01,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:28:01,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 235 transitions. Stem has 5 letters. Loop has 36 letters. [2020-06-22 04:28:01,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:28:01,975 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148783 states and 228328 transitions. [2020-06-22 04:28:02,780 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 04:28:02,781 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148783 states to 0 states and 0 transitions. [2020-06-22 04:28:02,781 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 04:28:02,781 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 04:28:02,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 04:28:02,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 04:28:02,781 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 04:28:02,781 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 04:28:02,781 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 04:28:02,781 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2020-06-22 04:28:02,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 04:28:02,782 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 04:28:02,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 04:28:02,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 04:28:02 BasicIcfg [2020-06-22 04:28:02,789 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 04:28:02,790 INFO L168 Benchmark]: Toolchain (without parser) took 65488.82 ms. Allocated memory was 649.6 MB in the beginning and 2.2 GB in the end (delta: 1.5 GB). Free memory was 566.3 MB in the beginning and 1.3 GB in the end (delta: -743.8 MB). Peak memory consumption was 766.6 MB. Max. memory is 50.3 GB. [2020-06-22 04:28:02,791 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 04:28:02,791 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.27 ms. Allocated memory was 649.6 MB in the beginning and 665.8 MB in the end (delta: 16.3 MB). Free memory was 565.3 MB in the beginning and 631.6 MB in the end (delta: -66.3 MB). Peak memory consumption was 29.4 MB. Max. memory is 50.3 GB. [2020-06-22 04:28:02,791 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.44 ms. Allocated memory is still 665.8 MB. Free memory was 631.6 MB in the beginning and 628.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. [2020-06-22 04:28:02,792 INFO L168 Benchmark]: Boogie Preprocessor took 19.58 ms. Allocated memory is still 665.8 MB. Free memory was 628.7 MB in the beginning and 627.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 04:28:02,792 INFO L168 Benchmark]: RCFGBuilder took 208.64 ms. Allocated memory is still 665.8 MB. Free memory was 627.7 MB in the beginning and 612.9 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 50.3 GB. [2020-06-22 04:28:02,793 INFO L168 Benchmark]: BlockEncodingV2 took 78.48 ms. Allocated memory is still 665.8 MB. Free memory was 612.9 MB in the beginning and 607.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. [2020-06-22 04:28:02,793 INFO L168 Benchmark]: TraceAbstraction took 153.75 ms. Allocated memory is still 665.8 MB. Free memory was 606.4 MB in the beginning and 597.7 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 50.3 GB. [2020-06-22 04:28:02,794 INFO L168 Benchmark]: BuchiAutomizer took 64712.34 ms. Allocated memory was 665.8 MB in the beginning and 2.2 GB in the end (delta: 1.5 GB). Free memory was 597.7 MB in the beginning and 1.3 GB in the end (delta: -712.5 MB). Peak memory consumption was 781.7 MB. Max. memory is 50.3 GB. [2020-06-22 04:28:02,797 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 15 edges - StatisticsResult: Encoded RCFG 6 locations, 12 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 276.27 ms. Allocated memory was 649.6 MB in the beginning and 665.8 MB in the end (delta: 16.3 MB). Free memory was 565.3 MB in the beginning and 631.6 MB in the end (delta: -66.3 MB). Peak memory consumption was 29.4 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 34.44 ms. Allocated memory is still 665.8 MB. Free memory was 631.6 MB in the beginning and 628.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 19.58 ms. Allocated memory is still 665.8 MB. Free memory was 628.7 MB in the beginning and 627.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 208.64 ms. Allocated memory is still 665.8 MB. Free memory was 627.7 MB in the beginning and 612.9 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 78.48 ms. Allocated memory is still 665.8 MB. Free memory was 612.9 MB in the beginning and 607.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 153.75 ms. Allocated memory is still 665.8 MB. Free memory was 606.4 MB in the beginning and 597.7 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 64712.34 ms. Allocated memory was 665.8 MB in the beginning and 2.2 GB in the end (delta: 1.5 GB). Free memory was 597.7 MB in the beginning and 1.3 GB in the end (delta: -712.5 MB). Peak memory consumption was 781.7 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - AllSpecificationsHoldResult: All specifications hold We were not able to verify any specifiation because the program does not contain any specification. - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 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=6occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 3 NumberOfFragments, 3 HoareAnnotationTreeSize, 3 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (4 trivial, 0 deterministic, 10 nondeterministic). One nondeterministic module has affine ranking function x and consists of 4 locations. One nondeterministic module has affine ranking function y + -1 * x and consists of 4 locations. One nondeterministic module has affine ranking function -1 * x + y and consists of 4 locations. One nondeterministic module has affine ranking function x and consists of 4 locations. One nondeterministic module has affine ranking function y and consists of 13 locations. One nondeterministic module has affine ranking function x and consists of 17 locations. One nondeterministic module has affine ranking function x and consists of 39 locations. One nondeterministic module has affine ranking function y and consists of 229 locations. One nondeterministic module has affine ranking function y and consists of 18 locations. One nondeterministic module has affine ranking function y and consists of 60 locations. 4 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 64.6s and 12 iterations. TraceHistogramMax:4. Analysis of lassos took 7.7s. Construction of modules took 4.3s. Büchi inclusion checks took 50.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 13. Automata minimization 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 4359 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 1.6s Buchi closure took 0.0s. Biggest automaton had 510 states and ocurred in iteration 8. Nontrivial modules had stage [10, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 104/115 HoareTripleCheckerStatistics: 56 SDtfs, 880 SDslu, 1571 SDs, 0 SdLazy, 7790 SolverSat, 1156 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT7 conc0 concLT3 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital25 mio100 ax100 hnf100 lsp79 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq152 hnf94 smp94 dnf100 smp100 tf108 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 33 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 10 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 3.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 04:26:54.005 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 04:28:03.030 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check