YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 06:27:25,342 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 06:27:25,344 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 06:27:25,355 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 06:27:25,356 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 06:27:25,357 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 06:27:25,358 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 06:27:25,359 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 06:27:25,361 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 06:27:25,362 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 06:27:25,362 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 06:27:25,363 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 06:27:25,364 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 06:27:25,364 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 06:27:25,366 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 06:27:25,366 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 06:27:25,367 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 06:27:25,369 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 06:27:25,371 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 06:27:25,372 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 06:27:25,373 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 06:27:25,374 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 06:27:25,376 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 06:27:25,376 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 06:27:25,377 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 06:27:25,377 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 06:27:25,378 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 06:27:25,379 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 06:27:25,379 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 06:27:25,379 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 06:27:25,380 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 06:27:25,381 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 06:27:25,382 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 06:27:25,382 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 06:27:25,383 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 06:27:25,383 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 06:27:25,383 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 06:27:25,384 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 06:27:25,384 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 06:27:25,385 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 06:27:25,399 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 06:27:25,399 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 06:27:25,400 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 06:27:25,400 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 06:27:25,401 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 06:27:25,401 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 06:27:25,401 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 06:27:25,401 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 06:27:25,401 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 06:27:25,401 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 06:27:25,402 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 06:27:25,402 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 06:27:25,402 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 06:27:25,402 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 06:27:25,402 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:27:25,402 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 06:27:25,403 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 06:27:25,403 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 06:27:25,403 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 06:27:25,403 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 06:27:25,403 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 06:27:25,403 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 06:27:25,404 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 06:27:25,404 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 06:27:25,404 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 06:27:25,404 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 06:27:25,404 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 06:27:25,404 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 06:27:25,405 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 06:27:25,430 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 06:27:25,443 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 06:27:25,446 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 06:27:25,447 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 06:27:25,448 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 06:27:25,448 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 06:27:25,520 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/d5b220a77e424a4d8a7034fa0958842d/FLAG35eb09e36 [2020-06-22 06:27:25,850 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 06:27:25,851 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 06:27:25,858 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/d5b220a77e424a4d8a7034fa0958842d/FLAG35eb09e36 [2020-06-22 06:27:26,258 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/d5b220a77e424a4d8a7034fa0958842d [2020-06-22 06:27:26,269 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 06:27:26,270 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 06:27:26,272 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 06:27:26,272 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 06:27:26,275 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 06:27:26,276 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 06:27:26" (1/1) ... [2020-06-22 06:27:26,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49cbb7b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:27:26, skipping insertion in model container [2020-06-22 06:27:26,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 06:27:26" (1/1) ... [2020-06-22 06:27:26,287 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 06:27:26,305 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 06:27:26,460 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 06:27:26,465 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 06:27:26,537 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 06:27:26,552 INFO L195 MainTranslator]: Completed translation [2020-06-22 06:27:26,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:27:26 WrapperNode [2020-06-22 06:27:26,552 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 06:27:26,553 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 06:27:26,553 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 06:27:26,553 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 06:27:26,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:27:26" (1/1) ... [2020-06-22 06:27:26,569 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:27:26" (1/1) ... [2020-06-22 06:27:26,589 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 06:27:26,590 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 06:27:26,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 06:27:26,590 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 06:27:26,599 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:27:26" (1/1) ... [2020-06-22 06:27:26,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:27:26" (1/1) ... [2020-06-22 06:27:26,600 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:27:26" (1/1) ... [2020-06-22 06:27:26,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:27:26" (1/1) ... [2020-06-22 06:27:26,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:27:26" (1/1) ... [2020-06-22 06:27:26,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:27:26" (1/1) ... [2020-06-22 06:27:26,608 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:27:26" (1/1) ... [2020-06-22 06:27:26,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 06:27:26,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 06:27:26,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 06:27:26,611 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 06:27:26,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:27:26" (1/1) ... No working directory specified, using /export/starexec/sandbox/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 06:27:26,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 06:27:26,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 06:27:26,830 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 06:27:26,831 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2020-06-22 06:27:26,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 06:27:26 BoogieIcfgContainer [2020-06-22 06:27:26,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 06:27:26,833 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 06:27:26,833 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 06:27:26,835 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 06:27:26,836 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 06:27:26" (1/1) ... [2020-06-22 06:27:26,853 INFO L313 BlockEncoder]: Initial Icfg 11 locations, 15 edges [2020-06-22 06:27:26,854 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 06:27:26,855 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 06:27:26,856 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 06:27:26,856 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 06:27:26,858 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 06:27:26,859 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 06:27:26,859 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 06:27:26,876 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 06:27:26,892 INFO L200 BlockEncoder]: SBE split 2 edges [2020-06-22 06:27:26,897 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 06:27:26,899 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 06:27:26,927 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding [2020-06-22 06:27:26,930 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-06-22 06:27:26,931 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 06:27:26,932 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 06:27:26,932 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 06:27:26,932 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 06:27:26,933 INFO L313 BlockEncoder]: Encoded RCFG 7 locations, 11 edges [2020-06-22 06:27:26,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 06:27:26 BasicIcfg [2020-06-22 06:27:26,933 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 06:27:26,934 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 06:27:26,934 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 06:27:26,938 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 06:27:26,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 06:27:26" (1/4) ... [2020-06-22 06:27:26,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@525309f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 06:27:26, skipping insertion in model container [2020-06-22 06:27:26,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:27:26" (2/4) ... [2020-06-22 06:27:26,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@525309f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 06:27:26, skipping insertion in model container [2020-06-22 06:27:26,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 06:27:26" (3/4) ... [2020-06-22 06:27:26,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@525309f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 06:27:26, skipping insertion in model container [2020-06-22 06:27:26,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 06:27:26" (4/4) ... [2020-06-22 06:27:26,943 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 06:27:26,954 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 06:27:26,963 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 06:27:26,985 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 06:27:27,016 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 06:27:27,017 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 06:27:27,017 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 06:27:27,017 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 06:27:27,017 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 06:27:27,018 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 06:27:27,018 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 06:27:27,018 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 06:27:27,018 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 06:27:27,033 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2020-06-22 06:27:27,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 06:27:27,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-06-22 06:27:27,093 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 37) no Hoare annotation was computed. [2020-06-22 06:27:27,093 INFO L448 ceAbstractionStarter]: For program point L33-2(lines 33 37) no Hoare annotation was computed. [2020-06-22 06:27:27,093 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 06:27:27,094 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 30) no Hoare annotation was computed. [2020-06-22 06:27:27,094 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 39) no Hoare annotation was computed. [2020-06-22 06:27:27,094 INFO L448 ceAbstractionStarter]: For program point L26-2(lines 26 30) no Hoare annotation was computed. [2020-06-22 06:27:27,094 INFO L451 ceAbstractionStarter]: At program point L25-2(lines 24 40) the Hoare annotation is: true [2020-06-22 06:27:27,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 06:27:27 BasicIcfg [2020-06-22 06:27:27,103 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 06:27:27,103 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 06:27:27,104 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 06:27:27,107 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 06:27:27,108 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 06:27:27,108 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 06:27:26" (1/5) ... [2020-06-22 06:27:27,108 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@375f39c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 06:27:27, skipping insertion in model container [2020-06-22 06:27:27,109 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 06:27:27,109 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:27:26" (2/5) ... [2020-06-22 06:27:27,109 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@375f39c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 06:27:27, skipping insertion in model container [2020-06-22 06:27:27,109 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 06:27:27,109 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 06:27:26" (3/5) ... [2020-06-22 06:27:27,110 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@375f39c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 06:27:27, skipping insertion in model container [2020-06-22 06:27:27,110 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 06:27:27,110 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 06:27:26" (4/5) ... [2020-06-22 06:27:27,110 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@375f39c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 06:27:27, skipping insertion in model container [2020-06-22 06:27:27,111 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 06:27:27,111 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 06:27:27" (5/5) ... [2020-06-22 06:27:27,112 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 06:27:27,139 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 06:27:27,139 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 06:27:27,139 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 06:27:27,139 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 06:27:27,139 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 06:27:27,139 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 06:27:27,139 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 06:27:27,140 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 06:27:27,140 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 06:27:27,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-06-22 06:27:27,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 06:27:27,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:27:27,161 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:27:27,166 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 06:27:27,166 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 06:27:27,167 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 06:27:27,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-06-22 06:27:27,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 06:27:27,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:27:27,168 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:27:27,168 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 06:27:27,168 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 06:27:27,173 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue [41] ULTIMATE.startENTRY-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} 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~nondet4, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 7#L25-2true [2020-06-22 06:27:27,174 INFO L796 eck$LassoCheckResult]: Loop: 7#L25-2true [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 9#L25true [59] L25-->L26: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 4#L26true [39] L26-->L26-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~x~0_8 (- 1))) (< v_ULTIMATE.start_main_~x~0_8 v_ULTIMATE.start_main_~y~0_9)) 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_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 8#L26-2true [48] L26-2-->L25-2: Formula: (= v_ULTIMATE.start_main_~x~0_10 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0] 7#L25-2true [2020-06-22 06:27:27,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:27:27,180 INFO L82 PathProgramCache]: Analyzing trace with hash 72, now seen corresponding path program 1 times [2020-06-22 06:27:27,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:27:27,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:27:27,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:27:27,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:27:27,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:27:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:27,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:27:27,253 INFO L82 PathProgramCache]: Analyzing trace with hash 2381654, now seen corresponding path program 1 times [2020-06-22 06:27:27,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:27:27,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:27:27,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:27:27,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:27:27,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:27:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:27,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:27,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:27:27,270 INFO L82 PathProgramCache]: Analyzing trace with hash 67951645, now seen corresponding path program 1 times [2020-06-22 06:27:27,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:27:27,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:27:27,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:27:27,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:27:27,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:27:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:27,353 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:27:27,355 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:27:27,355 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:27:27,355 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:27:27,355 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 06:27:27,355 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:27:27,355 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:27:27,356 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:27:27,356 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 06:27:27,356 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:27:27,356 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:27:27,376 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 06:27:27,385 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 06:27:27,389 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 06:27:27,393 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 06:27:27,492 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:27:27,493 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/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 06:27:27,504 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:27:27,504 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:27:27,537 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:27:27,537 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/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 06:27:27,544 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:27:27,544 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:27:27,571 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:27:27,571 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/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 06:27:27,580 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:27:27,580 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:27:27,607 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:27:27,607 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=1} Honda state: {ULTIMATE.start_main_#t~nondet2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/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 06:27:27,613 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:27:27,614 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/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 06:27:27,649 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 06:27:27,650 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:27:27,702 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 06:27:27,704 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:27:27,704 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:27:27,704 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:27:27,704 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:27:27,704 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 06:27:27,704 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 06:27:27,705 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:27:27,705 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:27:27,705 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 06:27:27,705 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:27:27,705 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:27:27,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 06:27:27,711 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 06:27:27,715 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 06:27:27,721 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 06:27:27,826 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:27:27,832 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 06:27:27,833 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 06:27:27,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:27:27,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:27:27,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:27:27,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:27:27,840 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 06:27:27,840 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 06:27:27,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:27:27,849 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 06:27:27,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:27:27,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:27:27,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:27:27,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:27:27,853 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 06:27:27,853 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 06:27:27,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:27:27,862 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 06:27:27,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:27:27,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:27:27,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:27:27,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:27:27,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:27:27,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:27:27,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:27:27,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:27:27,869 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 06:27:27,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:27:27,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:27:27,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:27:27,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:27:27,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:27:27,871 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:27:27,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:27:27,882 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 06:27:27,889 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 06:27:27,890 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 06:27:27,892 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 06:27:27,892 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 06:27:27,893 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 06:27:27,893 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 06:27:27,894 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 06:27:27,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:27:27,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:27:27,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 06:27:27,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:27:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:27:27,946 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 06:27:27,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:27:28,006 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 06:27:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:27:28,057 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 06:27:28,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:27:28,069 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-06-22 06:27:28,074 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-06-22 06:27:28,075 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states. Second operand 4 states. [2020-06-22 06:27:28,255 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states.. Second operand 4 states. Result 37 states and 59 transitions. Complement of second has 13 states. [2020-06-22 06:27:28,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 2 accepting loop states [2020-06-22 06:27:28,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 06:27:28,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 34 transitions. [2020-06-22 06:27:28,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 34 transitions. Stem has 1 letters. Loop has 4 letters. [2020-06-22 06:27:28,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:27:28,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 34 transitions. Stem has 5 letters. Loop has 4 letters. [2020-06-22 06:27:28,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:27:28,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 34 transitions. Stem has 1 letters. Loop has 8 letters. [2020-06-22 06:27:28,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:27:28,272 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 59 transitions. [2020-06-22 06:27:28,274 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2020-06-22 06:27:28,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 28 states and 45 transitions. [2020-06-22 06:27:28,282 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-06-22 06:27:28,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-06-22 06:27:28,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 45 transitions. [2020-06-22 06:27:28,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 06:27:28,284 INFO L706 BuchiCegarLoop]: Abstraction has 28 states and 45 transitions. [2020-06-22 06:27:28,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 45 transitions. [2020-06-22 06:27:28,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 17. [2020-06-22 06:27:28,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 06:27:28,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 27 transitions. [2020-06-22 06:27:28,317 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 27 transitions. [2020-06-22 06:27:28,317 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 27 transitions. [2020-06-22 06:27:28,317 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 06:27:28,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 27 transitions. [2020-06-22 06:27:28,318 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-06-22 06:27:28,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:27:28,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:27:28,319 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 06:27:28,319 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 06:27:28,320 INFO L794 eck$LassoCheckResult]: Stem: 121#ULTIMATE.startENTRY [41] ULTIMATE.startENTRY-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} 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~nondet4, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 122#L25-2 [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 129#L25 [2020-06-22 06:27:28,320 INFO L796 eck$LassoCheckResult]: Loop: 129#L25 [59] L25-->L26: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 116#L26 [55] L26-->L26-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_9 v_ULTIMATE.start_main_~y~0_11) (= v_ULTIMATE.start_main_~y~0_10 (+ v_ULTIMATE.start_main_~y~0_11 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 117#L26-2 [48] L26-2-->L25-2: Formula: (= v_ULTIMATE.start_main_~x~0_10 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0] 130#L25-2 [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 129#L25 [2020-06-22 06:27:28,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:27:28,320 INFO L82 PathProgramCache]: Analyzing trace with hash 2279, now seen corresponding path program 1 times [2020-06-22 06:27:28,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:27:28,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:27:28,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:27:28,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:27:28,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:27:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:28,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:27:28,331 INFO L82 PathProgramCache]: Analyzing trace with hash 2735580, now seen corresponding path program 1 times [2020-06-22 06:27:28,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:27:28,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:27:28,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:27:28,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:27:28,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:27:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:28,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:27:28,340 INFO L82 PathProgramCache]: Analyzing trace with hash 2106516418, now seen corresponding path program 1 times [2020-06-22 06:27:28,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:27:28,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:27:28,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:27:28,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:27:28,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:27:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:28,377 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:27:28,377 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:27:28,377 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:27:28,377 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:27:28,377 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 06:27:28,378 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:27:28,378 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:27:28,378 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:27:28,378 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 06:27:28,378 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:27:28,378 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:27:28,380 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 06:27:28,385 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 06:27:28,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:27:28,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:27:28,474 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:27:28,475 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/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 06:27:28,479 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:27:28,480 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:27:28,508 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:27:28,508 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/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 06:27:28,518 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:27:28,518 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/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 06:27:28,553 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 06:27:28,554 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:27:28,683 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 06:27:28,686 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:27:28,686 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:27:28,686 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:27:28,686 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:27:28,687 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 06:27:28,687 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 06:27:28,687 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:27:28,687 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:27:28,687 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 06:27:28,687 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:27:28,687 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:27:28,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 06:27:28,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 06:27:28,703 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 06:27:28,706 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 06:27:28,769 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:27:28,769 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 06:27:28,770 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 06:27:28,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:27:28,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:27:28,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:27:28,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:27:28,773 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 06:27:28,773 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 06:27:28,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:27:28,777 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 06:27:28,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:27:28,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:27:28,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:27:28,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:27:28,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:27:28,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:27:28,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:27:28,786 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 06:27:28,794 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 06:27:28,794 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 06:27:28,794 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 06:27:28,794 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 06:27:28,795 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 06:27:28,795 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 06:27:28,795 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 06:27:28,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:27:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:27:28,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 06:27:28,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:27:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:27:28,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 06:27:28,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:27:28,827 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 06:27:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:27:28,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 06:27:28,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:27:28,866 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 06:27:28,866 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 06:27:28,866 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 27 transitions. cyclomatic complexity: 13 Second operand 4 states. [2020-06-22 06:27:28,924 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 27 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 34 states and 64 transitions. Complement of second has 9 states. [2020-06-22 06:27:28,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states [2020-06-22 06:27:28,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 06:27:28,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2020-06-22 06:27:28,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 4 letters. [2020-06-22 06:27:28,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:27:28,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 6 letters. Loop has 4 letters. [2020-06-22 06:27:28,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:27:28,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 8 letters. [2020-06-22 06:27:28,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:27:28,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 64 transitions. [2020-06-22 06:27:28,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 06:27:28,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 27 states and 43 transitions. [2020-06-22 06:27:28,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-06-22 06:27:28,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-06-22 06:27:28,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 43 transitions. [2020-06-22 06:27:28,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 06:27:28,934 INFO L706 BuchiCegarLoop]: Abstraction has 27 states and 43 transitions. [2020-06-22 06:27:28,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 43 transitions. [2020-06-22 06:27:28,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2020-06-22 06:27:28,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-06-22 06:27:28,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 38 transitions. [2020-06-22 06:27:28,937 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 38 transitions. [2020-06-22 06:27:28,937 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 38 transitions. [2020-06-22 06:27:28,937 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 06:27:28,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 38 transitions. [2020-06-22 06:27:28,938 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 06:27:28,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:27:28,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:27:28,939 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 06:27:28,939 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 06:27:28,940 INFO L794 eck$LassoCheckResult]: Stem: 228#ULTIMATE.startENTRY [41] ULTIMATE.startENTRY-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} 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~nondet4, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 229#L25-2 [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 245#L25 [51] L25-->L33: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 230#L33 [2020-06-22 06:27:28,940 INFO L796 eck$LassoCheckResult]: Loop: 230#L33 [56] L33-->L33-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_14 v_ULTIMATE.start_main_~y~0_13) (= v_ULTIMATE.start_main_~x~0_13 (+ v_ULTIMATE.start_main_~y~0_13 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_14} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 224#L33-2 [38] L33-2-->L25-2: Formula: (= v_ULTIMATE.start_main_~y~0_14 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 225#L25-2 [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 239#L25 [51] L25-->L33: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 230#L33 [2020-06-22 06:27:28,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:27:28,940 INFO L82 PathProgramCache]: Analyzing trace with hash 70700, now seen corresponding path program 1 times [2020-06-22 06:27:28,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:27:28,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:27:28,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:27:28,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:27:28,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:27:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:28,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:27:28,948 INFO L82 PathProgramCache]: Analyzing trace with hash 2629843, now seen corresponding path program 1 times [2020-06-22 06:27:28,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:27:28,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:27:28,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:27:28,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:27:28,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:27:28,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:28,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:27:28,956 INFO L82 PathProgramCache]: Analyzing trace with hash 870131582, now seen corresponding path program 1 times [2020-06-22 06:27:28,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:27:28,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:27:28,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:27:28,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:27:28,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:27:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:28,987 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:27:28,988 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:27:28,988 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:27:28,988 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:27:28,988 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 06:27:28,988 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:27:28,988 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:27:28,989 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:27:28,989 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 06:27:28,989 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:27:28,989 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:27:28,991 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 06:27:28,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 06:27:28,996 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 06:27:29,006 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 06:27:29,057 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:27:29,057 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/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 06:27:29,062 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:27:29,063 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:27:29,067 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:27:29,067 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_main_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/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 06:27:29,095 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:27:29,096 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:27:29,122 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:27:29,122 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/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 06:27:29,142 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:27:29,143 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/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 06:27:29,177 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 06:27:29,177 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:27:29,373 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 06:27:29,375 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:27:29,389 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:27:29,389 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:27:29,390 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:27:29,390 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 06:27:29,390 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 06:27:29,390 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:27:29,390 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:27:29,390 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 06:27:29,390 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:27:29,390 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:27:29,393 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 06:27:29,397 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 06:27:29,399 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 06:27:29,410 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 06:27:29,463 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:27:29,463 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 06:27:29,464 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 06:27:29,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:27:29,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:27:29,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:27:29,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:27:29,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:27:29,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:27:29,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:27:29,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:27:29,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 06:27:29,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:27:29,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:27:29,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:27:29,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:27:29,470 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 06:27:29,470 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 06:27:29,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:27:29,475 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 06:27:29,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:27:29,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:27:29,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:27:29,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:27:29,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:27:29,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:27:29,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:27:29,483 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 06:27:29,488 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 06:27:29,488 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 06:27:29,488 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 06:27:29,489 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 06:27:29,489 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 06:27:29,489 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 06:27:29,489 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 06:27:29,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:27:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:27:29,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 06:27:29,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:27:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:27:29,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 06:27:29,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:27:29,531 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 06:27:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:27:29,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 06:27:29,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:27:29,549 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 06:27:29,549 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 06:27:29,549 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 23 states and 38 transitions. cyclomatic complexity: 18 Second operand 4 states. [2020-06-22 06:27:29,620 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 23 states and 38 transitions. cyclomatic complexity: 18. Second operand 4 states. Result 39 states and 66 transitions. Complement of second has 17 states. [2020-06-22 06:27:29,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 2 accepting loop states [2020-06-22 06:27:29,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 06:27:29,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2020-06-22 06:27:29,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 3 letters. Loop has 4 letters. [2020-06-22 06:27:29,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:27:29,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 7 letters. Loop has 4 letters. [2020-06-22 06:27:29,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:27:29,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 3 letters. Loop has 8 letters. [2020-06-22 06:27:29,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:27:29,624 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 66 transitions. [2020-06-22 06:27:29,626 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2020-06-22 06:27:29,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 31 states and 51 transitions. [2020-06-22 06:27:29,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-06-22 06:27:29,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-06-22 06:27:29,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 51 transitions. [2020-06-22 06:27:29,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 06:27:29,627 INFO L706 BuchiCegarLoop]: Abstraction has 31 states and 51 transitions. [2020-06-22 06:27:29,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 51 transitions. [2020-06-22 06:27:29,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2020-06-22 06:27:29,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 06:27:29,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 47 transitions. [2020-06-22 06:27:29,631 INFO L729 BuchiCegarLoop]: Abstraction has 29 states and 47 transitions. [2020-06-22 06:27:29,631 INFO L609 BuchiCegarLoop]: Abstraction has 29 states and 47 transitions. [2020-06-22 06:27:29,631 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 06:27:29,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 47 transitions. [2020-06-22 06:27:29,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-06-22 06:27:29,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:27:29,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:27:29,632 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 06:27:29,632 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2020-06-22 06:27:29,633 INFO L794 eck$LassoCheckResult]: Stem: 361#ULTIMATE.startENTRY [41] ULTIMATE.startENTRY-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} 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~nondet4, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 362#L25-2 [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 383#L25 [51] L25-->L33: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 363#L33 [2020-06-22 06:27:29,633 INFO L796 eck$LassoCheckResult]: Loop: 363#L33 [56] L33-->L33-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_14 v_ULTIMATE.start_main_~y~0_13) (= v_ULTIMATE.start_main_~x~0_13 (+ v_ULTIMATE.start_main_~y~0_13 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_14} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 357#L33-2 [38] L33-2-->L25-2: Formula: (= v_ULTIMATE.start_main_~y~0_14 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 358#L25-2 [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 379#L25 [59] L25-->L26: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 373#L26 [39] L26-->L26-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~x~0_8 (- 1))) (< v_ULTIMATE.start_main_~x~0_8 v_ULTIMATE.start_main_~y~0_9)) 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_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 384#L26-2 [48] L26-2-->L25-2: Formula: (= v_ULTIMATE.start_main_~x~0_10 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0] 378#L25-2 [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 374#L25 [51] L25-->L33: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 363#L33 [2020-06-22 06:27:29,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:27:29,634 INFO L82 PathProgramCache]: Analyzing trace with hash 70700, now seen corresponding path program 2 times [2020-06-22 06:27:29,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:27:29,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:27:29,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:27:29,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:27:29,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:27:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:29,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:27:29,641 INFO L82 PathProgramCache]: Analyzing trace with hash 2067312616, now seen corresponding path program 1 times [2020-06-22 06:27:29,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:27:29,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:27:29,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:27:29,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:27:29,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:27:29,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:29,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:27:29,652 INFO L82 PathProgramCache]: Analyzing trace with hash 711223571, now seen corresponding path program 1 times [2020-06-22 06:27:29,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:27:29,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:27:29,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:27:29,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:27:29,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:27:29,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:29,719 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:27:29,719 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:27:29,719 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:27:29,719 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:27:29,719 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 06:27:29,720 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:27:29,720 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:27:29,720 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:27:29,720 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 06:27:29,720 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:27:29,720 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:27:29,721 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 06:27:29,724 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 06:27:29,726 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 06:27:29,728 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 06:27:29,784 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:27:29,784 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/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 06:27:29,793 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:27:29,793 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:27:29,820 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:27:29,820 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=1} Honda state: {ULTIMATE.start_main_#t~nondet2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/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 06:27:29,825 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:27:29,825 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:27:29,852 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:27:29,852 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/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 06:27:29,859 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:27:29,859 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:27:29,885 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:27:29,886 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/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 06:27:29,891 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:27:29,891 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/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 06:27:29,923 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 06:27:29,923 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:27:30,043 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 06:27:30,045 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:27:30,045 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:27:30,045 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:27:30,045 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:27:30,045 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 06:27:30,046 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 06:27:30,046 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:27:30,046 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:27:30,046 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 06:27:30,046 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:27:30,046 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:27:30,048 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 06:27:30,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 06:27:30,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 06:27:30,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 06:27:30,113 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:27:30,113 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 06:27:30,114 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 06:27:30,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:27:30,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:27:30,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:27:30,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:27:30,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:27:30,115 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:27:30,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:27:30,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:27:30,118 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 06:27:30,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:27:30,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:27:30,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:27:30,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:27:30,120 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 06:27:30,120 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 06:27:30,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:27:30,124 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 06:27:30,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:27:30,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:27:30,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:27:30,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:27:30,126 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 06:27:30,127 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 06:27:30,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:27:30,129 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 06:27:30,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:27:30,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:27:30,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:27:30,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:27:30,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:27:30,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:27:30,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:27:30,137 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 06:27:30,141 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 06:27:30,141 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 06:27:30,141 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 06:27:30,141 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 06:27:30,141 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 06:27:30,142 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 06:27:30,142 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 06:27:30,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:27:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:27:30,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 06:27:30,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:27:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:27:30,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 06:27:30,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:27:30,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 06:27:30,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:30,205 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 06:27:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:30,210 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 06:27:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:27:30,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 06:27:30,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:27:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:27:30,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 06:27:30,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:27:30,245 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-06-22 06:27:30,245 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 06:27:30,246 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 29 states and 47 transitions. cyclomatic complexity: 21 Second operand 5 states. [2020-06-22 06:27:30,449 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 29 states and 47 transitions. cyclomatic complexity: 21. Second operand 5 states. Result 72 states and 111 transitions. Complement of second has 28 states. [2020-06-22 06:27:30,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 7 non-accepting loop states 3 accepting loop states [2020-06-22 06:27:30,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 06:27:30,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 34 transitions. [2020-06-22 06:27:30,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 34 transitions. Stem has 3 letters. Loop has 8 letters. [2020-06-22 06:27:30,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:27:30,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 34 transitions. Stem has 11 letters. Loop has 8 letters. [2020-06-22 06:27:30,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:27:30,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 34 transitions. Stem has 3 letters. Loop has 16 letters. [2020-06-22 06:27:30,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:27:30,455 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 111 transitions. [2020-06-22 06:27:30,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2020-06-22 06:27:30,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 46 states and 71 transitions. [2020-06-22 06:27:30,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-06-22 06:27:30,459 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-06-22 06:27:30,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 71 transitions. [2020-06-22 06:27:30,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 06:27:30,459 INFO L706 BuchiCegarLoop]: Abstraction has 46 states and 71 transitions. [2020-06-22 06:27:30,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 71 transitions. [2020-06-22 06:27:30,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2020-06-22 06:27:30,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-06-22 06:27:30,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 60 transitions. [2020-06-22 06:27:30,463 INFO L729 BuchiCegarLoop]: Abstraction has 38 states and 60 transitions. [2020-06-22 06:27:30,463 INFO L609 BuchiCegarLoop]: Abstraction has 38 states and 60 transitions. [2020-06-22 06:27:30,463 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 06:27:30,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 60 transitions. [2020-06-22 06:27:30,464 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2020-06-22 06:27:30,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:27:30,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:27:30,465 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1] [2020-06-22 06:27:30,465 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1] [2020-06-22 06:27:30,465 INFO L794 eck$LassoCheckResult]: Stem: 607#ULTIMATE.startENTRY [41] ULTIMATE.startENTRY-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} 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~nondet4, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 608#L25-2 [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 620#L25 [51] L25-->L33: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 609#L33 [43] L33-->L33-2: Formula: (and (< v_ULTIMATE.start_main_~x~0_12 v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~x~0_11 (+ v_ULTIMATE.start_main_~x~0_12 (- 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_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 603#L33-2 [38] L33-2-->L25-2: Formula: (= v_ULTIMATE.start_main_~y~0_14 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 604#L25-2 [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 639#L25 [51] L25-->L33: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 626#L33 [56] L33-->L33-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_14 v_ULTIMATE.start_main_~y~0_13) (= v_ULTIMATE.start_main_~x~0_13 (+ v_ULTIMATE.start_main_~y~0_13 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_14} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 621#L33-2 [38] L33-2-->L25-2: Formula: (= v_ULTIMATE.start_main_~y~0_14 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 618#L25-2 [2020-06-22 06:27:30,466 INFO L796 eck$LassoCheckResult]: Loop: 618#L25-2 [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 616#L25 [59] L25-->L26: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 605#L26 [39] L26-->L26-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~x~0_8 (- 1))) (< v_ULTIMATE.start_main_~x~0_8 v_ULTIMATE.start_main_~y~0_9)) 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_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 606#L26-2 [48] L26-2-->L25-2: Formula: (= v_ULTIMATE.start_main_~x~0_10 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0] 633#L25-2 [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 631#L25 [51] L25-->L33: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 610#L33 [56] L33-->L33-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_14 v_ULTIMATE.start_main_~y~0_13) (= v_ULTIMATE.start_main_~x~0_13 (+ v_ULTIMATE.start_main_~y~0_13 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_14} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 603#L33-2 [38] L33-2-->L25-2: Formula: (= v_ULTIMATE.start_main_~y~0_14 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 604#L25-2 [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 639#L25 [51] L25-->L33: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 626#L33 [56] L33-->L33-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_14 v_ULTIMATE.start_main_~y~0_13) (= v_ULTIMATE.start_main_~x~0_13 (+ v_ULTIMATE.start_main_~y~0_13 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_14} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 621#L33-2 [38] L33-2-->L25-2: Formula: (= v_ULTIMATE.start_main_~y~0_14 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 618#L25-2 [2020-06-22 06:27:30,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:27:30,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1694349607, now seen corresponding path program 1 times [2020-06-22 06:27:30,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:27:30,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:27:30,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:27:30,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:27:30,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:27:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:30,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:27:30,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1429426182, now seen corresponding path program 2 times [2020-06-22 06:27:30,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:27:30,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:27:30,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:27:30,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:27:30,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:27:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:30,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:27:30,488 INFO L82 PathProgramCache]: Analyzing trace with hash -450661678, now seen corresponding path program 1 times [2020-06-22 06:27:30,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:27:30,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:27:30,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:27:30,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:27:30,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:27:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:30,575 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:27:30,575 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:27:30,575 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:27:30,575 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:27:30,575 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 06:27:30,575 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:27:30,576 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:27:30,576 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:27:30,576 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-22 06:27:30,576 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:27:30,576 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:27:30,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 06:27:30,588 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 06:27:30,591 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 06:27:30,593 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 06:27:30,635 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:27:30,635 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/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 06:27:30,640 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:27:30,640 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/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 06:27:30,674 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 06:27:30,674 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:27:30,715 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 06:27:30,717 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:27:30,718 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:27:30,718 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:27:30,718 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:27:30,718 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 06:27:30,718 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 06:27:30,718 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:27:30,718 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:27:30,718 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-22 06:27:30,718 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:27:30,719 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:27:30,720 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 06:27:30,723 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 06:27:30,732 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 06:27:30,734 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 06:27:30,773 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:27:30,774 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 06:27:30,774 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 06:27:30,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:27:30,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:27:30,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:27:30,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:27:30,776 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 06:27:30,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 06:27:30,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:27:30,779 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 06:27:30,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:27:30,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:27:30,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:27:30,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:27:30,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:27:30,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:27:30,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:27:30,785 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 06:27:30,788 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 06:27:30,788 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 06:27:30,789 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 06:27:30,789 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 06:27:30,789 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 06:27:30,789 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 06:27:30,789 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 06:27:30,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:27:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:27:30,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 06:27:30,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:27:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:27:30,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 06:27:30,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:27:30,859 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 06:27:30,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:30,893 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 06:27:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:30,900 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 06:27:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:30,906 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 06:27:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:27:30,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 06:27:30,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:27:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:27:30,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 06:27:30,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:27:30,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:27:30,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 06:27:30,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:27:30,977 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 9 predicates after loop cannibalization [2020-06-22 06:27:30,977 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 9 loop predicates [2020-06-22 06:27:30,977 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 38 states and 60 transitions. cyclomatic complexity: 25 Second operand 7 states. [2020-06-22 06:27:31,359 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 38 states and 60 transitions. cyclomatic complexity: 25. Second operand 7 states. Result 135 states and 209 transitions. Complement of second has 24 states. [2020-06-22 06:27:31,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 10 non-accepting loop states 3 accepting loop states [2020-06-22 06:27:31,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 06:27:31,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 42 transitions. [2020-06-22 06:27:31,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 42 transitions. Stem has 9 letters. Loop has 12 letters. [2020-06-22 06:27:31,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:27:31,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 42 transitions. Stem has 21 letters. Loop has 12 letters. [2020-06-22 06:27:31,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:27:31,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 42 transitions. Stem has 9 letters. Loop has 24 letters. [2020-06-22 06:27:31,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:27:31,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 209 transitions. [2020-06-22 06:27:31,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 82 [2020-06-22 06:27:31,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 98 states and 151 transitions. [2020-06-22 06:27:31,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-06-22 06:27:31,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-06-22 06:27:31,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 151 transitions. [2020-06-22 06:27:31,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 06:27:31,369 INFO L706 BuchiCegarLoop]: Abstraction has 98 states and 151 transitions. [2020-06-22 06:27:31,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 151 transitions. [2020-06-22 06:27:31,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 52. [2020-06-22 06:27:31,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-06-22 06:27:31,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 82 transitions. [2020-06-22 06:27:31,374 INFO L729 BuchiCegarLoop]: Abstraction has 52 states and 82 transitions. [2020-06-22 06:27:31,374 INFO L609 BuchiCegarLoop]: Abstraction has 52 states and 82 transitions. [2020-06-22 06:27:31,374 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 06:27:31,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 82 transitions. [2020-06-22 06:27:31,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2020-06-22 06:27:31,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:27:31,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:27:31,376 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1] [2020-06-22 06:27:31,376 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 2, 2, 2, 2, 2, 2] [2020-06-22 06:27:31,377 INFO L794 eck$LassoCheckResult]: Stem: 1019#ULTIMATE.startENTRY [41] ULTIMATE.startENTRY-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} 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~nondet4, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 1020#L25-2 [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 1040#L25 [51] L25-->L33: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 1021#L33 [43] L33-->L33-2: Formula: (and (< v_ULTIMATE.start_main_~x~0_12 v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~x~0_11 (+ v_ULTIMATE.start_main_~x~0_12 (- 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_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 1022#L33-2 [38] L33-2-->L25-2: Formula: (= v_ULTIMATE.start_main_~y~0_14 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 1051#L25-2 [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 1052#L25 [51] L25-->L33: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 1046#L33 [56] L33-->L33-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_14 v_ULTIMATE.start_main_~y~0_13) (= v_ULTIMATE.start_main_~x~0_13 (+ v_ULTIMATE.start_main_~y~0_13 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_14} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 1044#L33-2 [38] L33-2-->L25-2: Formula: (= v_ULTIMATE.start_main_~y~0_14 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 1024#L25-2 [2020-06-22 06:27:31,377 INFO L796 eck$LassoCheckResult]: Loop: 1024#L25-2 [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 1025#L25 [59] L25-->L26: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 1017#L26 [39] L26-->L26-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~x~0_8 (- 1))) (< v_ULTIMATE.start_main_~x~0_8 v_ULTIMATE.start_main_~y~0_9)) 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_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 1018#L26-2 [48] L26-2-->L25-2: Formula: (= v_ULTIMATE.start_main_~x~0_10 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0] 1028#L25-2 [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 1063#L25 [59] L25-->L26: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 1059#L26 [39] L26-->L26-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~x~0_8 (- 1))) (< v_ULTIMATE.start_main_~x~0_8 v_ULTIMATE.start_main_~y~0_9)) 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_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 1058#L26-2 [48] L26-2-->L25-2: Formula: (= v_ULTIMATE.start_main_~x~0_10 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0] 1055#L25-2 [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 1054#L25 [51] L25-->L33: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 1053#L33 [56] L33-->L33-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_14 v_ULTIMATE.start_main_~y~0_13) (= v_ULTIMATE.start_main_~x~0_13 (+ v_ULTIMATE.start_main_~y~0_13 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_14} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 1022#L33-2 [38] L33-2-->L25-2: Formula: (= v_ULTIMATE.start_main_~y~0_14 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 1051#L25-2 [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 1052#L25 [51] L25-->L33: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 1046#L33 [56] L33-->L33-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_14 v_ULTIMATE.start_main_~y~0_13) (= v_ULTIMATE.start_main_~x~0_13 (+ v_ULTIMATE.start_main_~y~0_13 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_14} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 1044#L33-2 [38] L33-2-->L25-2: Formula: (= v_ULTIMATE.start_main_~y~0_14 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 1024#L25-2 [2020-06-22 06:27:31,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:27:31,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1694349607, now seen corresponding path program 2 times [2020-06-22 06:27:31,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:27:31,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:27:31,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:27:31,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:27:31,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:27:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:31,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:27:31,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1302835151, now seen corresponding path program 3 times [2020-06-22 06:27:31,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:27:31,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:27:31,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:27:31,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:27:31,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:27:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:31,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:27:31,399 INFO L82 PathProgramCache]: Analyzing trace with hash 649152167, now seen corresponding path program 2 times [2020-06-22 06:27:31,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:27:31,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:27:31,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:27:31,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:27:31,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:27:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:31,531 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:27:31,531 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:27:31,531 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:27:31,531 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:27:31,531 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 06:27:31,531 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:27:31,532 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:27:31,532 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:27:31,532 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop [2020-06-22 06:27:31,532 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:27:31,532 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:27:31,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 06:27:31,537 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 06:27:31,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 06:27:31,543 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 06:27:31,610 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:27:31,611 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/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 06:27:31,616 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:27:31,616 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:27:31,646 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:27:31,647 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/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) [2020-06-22 06:27:31,656 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:27:31,656 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:27:31,683 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:27:31,683 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/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 06:27:31,690 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:27:31,690 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:27:31,716 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:27:31,716 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=1} Honda state: {ULTIMATE.start_main_#t~nondet2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:27:31,723 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:27:31,723 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/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 06:27:31,758 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 06:27:31,758 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:27:31,830 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 06:27:31,832 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:27:31,832 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:27:31,832 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:27:31,832 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:27:31,832 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 06:27:31,832 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 06:27:31,832 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:27:31,833 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:27:31,833 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop [2020-06-22 06:27:31,833 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:27:31,833 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:27:31,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:27:31,836 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 06:27:31,839 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 06:27:31,848 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 06:27:31,886 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:27:31,887 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 06:27:31,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 06:27:31,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:27:31,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:27:31,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:27:31,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:27:31,889 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 06:27:31,890 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 06:27:31,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:27:31,893 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 06:27:31,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:27:31,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:27:31,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:27:31,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:27:31,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:27:31,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:27:31,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:27:31,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:27:31,896 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 06:27:31,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:27:31,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:27:31,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:27:31,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:27:31,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:27:31,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:27:31,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:27:31,901 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 06:27:31,904 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 06:27:31,904 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 06:27:31,904 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 06:27:31,905 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 06:27:31,905 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 06:27:31,905 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 06:27:31,905 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 06:27:31,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:27:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:27:31,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 06:27:31,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:27:31,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:27:31,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 06:27:31,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:27:31,982 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 06:27:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:32,016 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 06:27:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:32,023 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 06:27:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:32,030 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 06:27:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:32,037 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 06:27:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:32,044 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 06:27:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:27:32,051 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 06:27:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:27:32,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 06:27:32,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:27:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:27:32,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 06:27:32,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:27:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:27:32,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 06:27:32,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:27:32,144 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 11 predicates after loop cannibalization [2020-06-22 06:27:32,144 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 11 loop predicates [2020-06-22 06:27:32,144 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 52 states and 82 transitions. cyclomatic complexity: 33 Second operand 8 states. [2020-06-22 06:27:32,698 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 52 states and 82 transitions. cyclomatic complexity: 33. Second operand 8 states. Result 198 states and 286 transitions. Complement of second has 36 states. [2020-06-22 06:27:32,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 1 stem states 16 non-accepting loop states 3 accepting loop states [2020-06-22 06:27:32,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 06:27:32,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 60 transitions. [2020-06-22 06:27:32,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 60 transitions. Stem has 9 letters. Loop has 16 letters. [2020-06-22 06:27:32,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:27:32,700 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-06-22 06:27:32,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:27:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:27:32,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 06:27:32,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:27:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:27:32,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 06:27:32,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:27:32,772 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 06:27:32,773 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2020-06-22 06:27:32,773 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 52 states and 82 transitions. cyclomatic complexity: 33 Second operand 8 states. [2020-06-22 06:27:33,030 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 52 states and 82 transitions. cyclomatic complexity: 33. Second operand 8 states. Result 268 states and 421 transitions. Complement of second has 51 states. [2020-06-22 06:27:33,031 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 06:27:33,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 06:27:33,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2020-06-22 06:27:33,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 56 transitions. Stem has 9 letters. Loop has 16 letters. [2020-06-22 06:27:33,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:27:33,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 56 transitions. Stem has 25 letters. Loop has 16 letters. [2020-06-22 06:27:33,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:27:33,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 56 transitions. Stem has 9 letters. Loop has 32 letters. [2020-06-22 06:27:33,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:27:33,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 268 states and 421 transitions. [2020-06-22 06:27:33,039 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 06:27:33,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 268 states to 0 states and 0 transitions. [2020-06-22 06:27:33,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 06:27:33,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 06:27:33,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 06:27:33,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 06:27:33,039 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 06:27:33,040 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 06:27:33,040 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 06:27:33,040 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 06:27:33,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 06:27:33,040 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 06:27:33,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 06:27:33,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 06:27:33 BasicIcfg [2020-06-22 06:27:33,047 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 06:27:33,047 INFO L168 Benchmark]: Toolchain (without parser) took 6777.73 ms. Allocated memory was 649.6 MB in the beginning and 777.0 MB in the end (delta: 127.4 MB). Free memory was 565.0 MB in the beginning and 426.9 MB in the end (delta: 138.1 MB). Peak memory consumption was 265.5 MB. Max. memory is 50.3 GB. [2020-06-22 06:27:33,049 INFO L168 Benchmark]: CDTParser took 0.17 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 06:27:33,049 INFO L168 Benchmark]: CACSL2BoogieTranslator took 281.19 ms. Allocated memory was 649.6 MB in the beginning and 700.4 MB in the end (delta: 50.9 MB). Free memory was 565.0 MB in the beginning and 666.3 MB in the end (delta: -101.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 50.3 GB. [2020-06-22 06:27:33,050 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.08 ms. Allocated memory is still 700.4 MB. Free memory was 666.3 MB in the beginning and 665.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 06:27:33,051 INFO L168 Benchmark]: Boogie Preprocessor took 20.33 ms. Allocated memory is still 700.4 MB. Free memory was 665.2 MB in the beginning and 662.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. [2020-06-22 06:27:33,051 INFO L168 Benchmark]: RCFGBuilder took 222.06 ms. Allocated memory is still 700.4 MB. Free memory was 662.4 MB in the beginning and 647.6 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 50.3 GB. [2020-06-22 06:27:33,052 INFO L168 Benchmark]: BlockEncodingV2 took 100.63 ms. Allocated memory is still 700.4 MB. Free memory was 647.6 MB in the beginning and 643.3 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 50.3 GB. [2020-06-22 06:27:33,052 INFO L168 Benchmark]: TraceAbstraction took 168.76 ms. Allocated memory is still 700.4 MB. Free memory was 642.2 MB in the beginning and 633.4 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 50.3 GB. [2020-06-22 06:27:33,053 INFO L168 Benchmark]: BuchiAutomizer took 5943.39 ms. Allocated memory was 700.4 MB in the beginning and 777.0 MB in the end (delta: 76.5 MB). Free memory was 633.4 MB in the beginning and 426.9 MB in the end (delta: 206.5 MB). Peak memory consumption was 283.1 MB. Max. memory is 50.3 GB. [2020-06-22 06:27:33,058 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 11 locations, 15 edges - StatisticsResult: Encoded RCFG 7 locations, 11 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 281.19 ms. Allocated memory was 649.6 MB in the beginning and 700.4 MB in the end (delta: 50.9 MB). Free memory was 565.0 MB in the beginning and 666.3 MB in the end (delta: -101.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 36.08 ms. Allocated memory is still 700.4 MB. Free memory was 666.3 MB in the beginning and 665.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 20.33 ms. Allocated memory is still 700.4 MB. Free memory was 665.2 MB in the beginning and 662.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. * RCFGBuilder took 222.06 ms. Allocated memory is still 700.4 MB. Free memory was 662.4 MB in the beginning and 647.6 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 100.63 ms. Allocated memory is still 700.4 MB. Free memory was 647.6 MB in the beginning and 643.3 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 50.3 GB. * TraceAbstraction took 168.76 ms. Allocated memory is still 700.4 MB. Free memory was 642.2 MB in the beginning and 633.4 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 5943.39 ms. Allocated memory was 700.4 MB in the beginning and 777.0 MB in the end (delta: 76.5 MB). Free memory was 633.4 MB in the beginning and 426.9 MB in the end (delta: 206.5 MB). Peak memory consumption was 283.1 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: 24]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 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=7occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (0 trivial, 0 deterministic, 6 nondeterministic). One nondeterministic module has affine ranking function y and consists of 8 locations. One nondeterministic module has affine ranking function y and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 6 locations. One nondeterministic module has affine ranking function y and consists of 11 locations. One nondeterministic module has affine ranking function x and consists of 14 locations. One nondeterministic module has affine ranking function x and consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.9s and 7 iterations. TraceHistogramMax:4. Analysis of lassos took 3.1s. Construction of modules took 0.4s. Büchi inclusion checks took 2.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 71 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 52 states and ocurred in iteration 5. Nontrivial modules had stage [5, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 9/26 HoareTripleCheckerStatistics: 99 SDtfs, 259 SDslu, 247 SDs, 0 SdLazy, 607 SolverSat, 112 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT6 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital23 mio100 ax151 hnf100 lsp57 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq143 hnf94 smp100 dnf100 smp100 tf107 neg100 sie115 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 12 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 06:27:23.021 ----------------------------------------------- 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/sandbox/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/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 06:27:33.293 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check