NO Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 02:23:10,864 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 02:23:10,866 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 02:23:10,877 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 02:23:10,877 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 02:23:10,878 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 02:23:10,879 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 02:23:10,881 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 02:23:10,883 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 02:23:10,883 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 02:23:10,884 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 02:23:10,884 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 02:23:10,885 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 02:23:10,886 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 02:23:10,887 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 02:23:10,888 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 02:23:10,889 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 02:23:10,890 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 02:23:10,892 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 02:23:10,894 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 02:23:10,895 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 02:23:10,896 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 02:23:10,898 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 02:23:10,898 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 02:23:10,898 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 02:23:10,899 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 02:23:10,899 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 02:23:10,900 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 02:23:10,900 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 02:23:10,901 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 02:23:10,902 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 02:23:10,903 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 02:23:10,904 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 02:23:10,904 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 02:23:10,904 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 02:23:10,904 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 02:23:10,905 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 02:23:10,906 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 02:23:10,906 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 02:23:10,907 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 02:23:10,921 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 02:23:10,921 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 02:23:10,922 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 02:23:10,923 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 02:23:10,923 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 02:23:10,923 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 02:23:10,923 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 02:23:10,923 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 02:23:10,923 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 02:23:10,924 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 02:23:10,924 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 02:23:10,924 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 02:23:10,924 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 02:23:10,924 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 02:23:10,924 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:23:10,924 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 02:23:10,925 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 02:23:10,925 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 02:23:10,925 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 02:23:10,925 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 02:23:10,925 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 02:23:10,925 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 02:23:10,926 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 02:23:10,926 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 02:23:10,926 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 02:23:10,926 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 02:23:10,926 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 02:23:10,926 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 02:23:10,927 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 02:23:10,952 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 02:23:10,964 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 02:23:10,968 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 02:23:10,969 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 02:23:10,970 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 02:23:10,970 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 02:23:11,044 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/7282123c0e494c8f991d0746f2c8202b/FLAG3f266914d [2020-06-22 02:23:11,388 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 02:23:11,389 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 02:23:11,396 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/7282123c0e494c8f991d0746f2c8202b/FLAG3f266914d [2020-06-22 02:23:11,788 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/7282123c0e494c8f991d0746f2c8202b [2020-06-22 02:23:11,800 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 02:23:11,801 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 02:23:11,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 02:23:11,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 02:23:11,806 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 02:23:11,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 02:23:11" (1/1) ... [2020-06-22 02:23:11,810 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c1e5dd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:23:11, skipping insertion in model container [2020-06-22 02:23:11,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 02:23:11" (1/1) ... [2020-06-22 02:23:11,818 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 02:23:11,836 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 02:23:12,000 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 02:23:12,005 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 02:23:12,085 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 02:23:12,099 INFO L195 MainTranslator]: Completed translation [2020-06-22 02:23:12,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:23:12 WrapperNode [2020-06-22 02:23:12,100 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 02:23:12,101 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 02:23:12,101 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 02:23:12,101 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 02:23:12,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:23:12" (1/1) ... [2020-06-22 02:23:12,117 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:23:12" (1/1) ... [2020-06-22 02:23:12,135 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 02:23:12,135 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 02:23:12,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 02:23:12,136 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 02:23:12,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:23:12" (1/1) ... [2020-06-22 02:23:12,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:23:12" (1/1) ... [2020-06-22 02:23:12,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:23:12" (1/1) ... [2020-06-22 02:23:12,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:23:12" (1/1) ... [2020-06-22 02:23:12,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:23:12" (1/1) ... [2020-06-22 02:23:12,150 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:23:12" (1/1) ... [2020-06-22 02:23:12,151 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:23:12" (1/1) ... [2020-06-22 02:23:12,152 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 02:23:12,152 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 02:23:12,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 02:23:12,153 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 02:23:12,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:23:12" (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 02:23:12,221 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2020-06-22 02:23:12,222 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2020-06-22 02:23:12,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 02:23:12,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 02:23:12,363 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 02:23:12,363 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2020-06-22 02:23:12,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:23:12 BoogieIcfgContainer [2020-06-22 02:23:12,365 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 02:23:12,365 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 02:23:12,365 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 02:23:12,367 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 02:23:12,368 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:23:12" (1/1) ... [2020-06-22 02:23:12,384 INFO L313 BlockEncoder]: Initial Icfg 17 locations, 21 edges [2020-06-22 02:23:12,386 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 02:23:12,387 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 02:23:12,387 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 02:23:12,388 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 02:23:12,389 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 02:23:12,390 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 02:23:12,390 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 02:23:12,408 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 02:23:12,434 INFO L200 BlockEncoder]: SBE split 2 edges [2020-06-22 02:23:12,439 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 02:23:12,440 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 02:23:12,453 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding [2020-06-22 02:23:12,455 INFO L70 RemoveSinkStates]: Removed 2 edges and 2 locations by removing sink states [2020-06-22 02:23:12,457 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 02:23:12,457 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 02:23:12,458 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 02:23:12,458 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 02:23:12,458 INFO L313 BlockEncoder]: Encoded RCFG 13 locations, 34 edges [2020-06-22 02:23:12,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 02:23:12 BasicIcfg [2020-06-22 02:23:12,459 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 02:23:12,460 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 02:23:12,460 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 02:23:12,464 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 02:23:12,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 02:23:11" (1/4) ... [2020-06-22 02:23:12,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b92319e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:23:12, skipping insertion in model container [2020-06-22 02:23:12,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:23:12" (2/4) ... [2020-06-22 02:23:12,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b92319e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:23:12, skipping insertion in model container [2020-06-22 02:23:12,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:23:12" (3/4) ... [2020-06-22 02:23:12,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b92319e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:23:12, skipping insertion in model container [2020-06-22 02:23:12,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 02:23:12" (4/4) ... [2020-06-22 02:23:12,470 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 02:23:12,481 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 02:23:12,490 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 02:23:12,507 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 02:23:12,535 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 02:23:12,536 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 02:23:12,536 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 02:23:12,536 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 02:23:12,537 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 02:23:12,537 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 02:23:12,537 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 02:23:12,537 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 02:23:12,537 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 02:23:12,555 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2020-06-22 02:23:12,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 02:23:12,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-06-22 02:23:12,629 INFO L451 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: true [2020-06-22 02:23:12,629 INFO L451 ceAbstractionStarter]: At program point L15(line 15) the Hoare annotation is: true [2020-06-22 02:23:12,630 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-06-22 02:23:12,630 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-06-22 02:23:12,630 INFO L451 ceAbstractionStarter]: At program point L13(line 13) the Hoare annotation is: true [2020-06-22 02:23:12,630 INFO L451 ceAbstractionStarter]: At program point recENTRY(lines 9 18) the Hoare annotation is: true [2020-06-22 02:23:12,630 INFO L448 ceAbstractionStarter]: For program point recFINAL(lines 9 18) no Hoare annotation was computed. [2020-06-22 02:23:12,631 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 17) no Hoare annotation was computed. [2020-06-22 02:23:12,631 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-06-22 02:23:12,631 INFO L448 ceAbstractionStarter]: For program point L10(lines 10 17) no Hoare annotation was computed. [2020-06-22 02:23:12,631 INFO L448 ceAbstractionStarter]: For program point recEXIT(lines 9 18) no Hoare annotation was computed. [2020-06-22 02:23:12,631 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 02:23:12,631 INFO L451 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: true [2020-06-22 02:23:12,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:23:12 BasicIcfg [2020-06-22 02:23:12,635 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 02:23:12,636 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 02:23:12,636 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 02:23:12,639 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 02:23:12,640 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:23:12,640 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 02:23:11" (1/5) ... [2020-06-22 02:23:12,641 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@530484b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 02:23:12, skipping insertion in model container [2020-06-22 02:23:12,641 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:23:12,641 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:23:12" (2/5) ... [2020-06-22 02:23:12,642 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@530484b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 02:23:12, skipping insertion in model container [2020-06-22 02:23:12,642 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:23:12,642 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:23:12" (3/5) ... [2020-06-22 02:23:12,642 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@530484b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 02:23:12, skipping insertion in model container [2020-06-22 02:23:12,642 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:23:12,643 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 02:23:12" (4/5) ... [2020-06-22 02:23:12,643 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@530484b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 02:23:12, skipping insertion in model container [2020-06-22 02:23:12,643 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:23:12,643 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:23:12" (5/5) ... [2020-06-22 02:23:12,645 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 02:23:12,673 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 02:23:12,674 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 02:23:12,674 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 02:23:12,674 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 02:23:12,674 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 02:23:12,674 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 02:23:12,674 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 02:23:12,674 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 02:23:12,675 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 02:23:12,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-06-22 02:23:12,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 02:23:12,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:23:12,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:23:12,709 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 02:23:12,709 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 02:23:12,710 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 02:23:12,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-06-22 02:23:12,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 02:23:12,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:23:12,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:23:12,713 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 02:23:12,713 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 02:23:12,718 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue [41] ULTIMATE.startENTRY-->L23: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 13#L23true [43] L23-->recENTRY: Formula: (= |v_rec_#in~xInParam_4| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec_#in~x=|v_rec_#in~xInParam_4|} AuxVars[] AssignedVars[rec_#in~x]< 4#recENTRYtrue [2020-06-22 02:23:12,719 INFO L796 eck$LassoCheckResult]: Loop: 4#recENTRYtrue [32] recENTRY-->L10: Formula: (= v_rec_~x_1 |v_rec_#in~x_1|) InVars {rec_#in~x=|v_rec_#in~x_1|} OutVars{rec_~x=v_rec_~x_1, rec_#in~x=|v_rec_#in~x_1|} AuxVars[] AssignedVars[rec_~x] 15#L10true [52] L10-->L12: Formula: (> v_rec_~x_3 0) InVars {rec_~x=v_rec_~x_3} OutVars{rec_~x=v_rec_~x_3} AuxVars[] AssignedVars[] 6#L12true [55] L12-->L13: Formula: (let ((.cse0 (mod v_rec_~x_4 2))) (and (< .cse0 0) (= 0 (+ .cse0 (- 2))) (< v_rec_~x_4 0))) InVars {rec_~x=v_rec_~x_4} OutVars{rec_~x=v_rec_~x_4} AuxVars[] AssignedVars[] 5#L13true [33] L13-->recENTRY: Formula: (= |v_rec_#in~xInParam_1| (let ((.cse0 (div v_rec_~x_10 2))) (ite (and (not (= 0 (mod v_rec_~x_10 2))) (< v_rec_~x_10 0)) (+ .cse0 1) .cse0))) InVars {rec_~x=v_rec_~x_10} OutVars{rec_#in~x=|v_rec_#in~xInParam_1|} AuxVars[] AssignedVars[rec_#in~x]< 4#recENTRYtrue [2020-06-22 02:23:12,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:12,725 INFO L82 PathProgramCache]: Analyzing trace with hash 2275, now seen corresponding path program 1 times [2020-06-22 02:23:12,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:12,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:12,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:12,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:23:12,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:12,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:12,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1928543, now seen corresponding path program 1 times [2020-06-22 02:23:12,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:12,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:12,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:12,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:23:12,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:23:12,857 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 02:23:12,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:23:12,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 02:23:12,863 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 02:23:12,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 02:23:12,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 02:23:12,880 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2020-06-22 02:23:12,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:23:12,942 INFO L93 Difference]: Finished difference Result 15 states and 22 transitions. [2020-06-22 02:23:12,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 02:23:12,946 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 22 transitions. [2020-06-22 02:23:12,949 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 02:23:12,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 22 transitions. [2020-06-22 02:23:12,958 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-06-22 02:23:12,958 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-06-22 02:23:12,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 22 transitions. [2020-06-22 02:23:12,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 02:23:12,961 INFO L706 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2020-06-22 02:23:12,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 22 transitions. [2020-06-22 02:23:12,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2020-06-22 02:23:12,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 02:23:12,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2020-06-22 02:23:12,994 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-06-22 02:23:12,994 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-06-22 02:23:12,994 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 02:23:12,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2020-06-22 02:23:12,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 02:23:12,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:23:12,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:23:12,996 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 02:23:12,996 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 02:23:12,996 INFO L794 eck$LassoCheckResult]: Stem: 48#ULTIMATE.startENTRY [41] ULTIMATE.startENTRY-->L23: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 41#L23 [43] L23-->recENTRY: Formula: (= |v_rec_#in~xInParam_4| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec_#in~x=|v_rec_#in~xInParam_4|} AuxVars[] AssignedVars[rec_#in~x]< 42#recENTRY [2020-06-22 02:23:12,997 INFO L796 eck$LassoCheckResult]: Loop: 42#recENTRY [32] recENTRY-->L10: Formula: (= v_rec_~x_1 |v_rec_#in~x_1|) InVars {rec_#in~x=|v_rec_#in~x_1|} OutVars{rec_~x=v_rec_~x_1, rec_#in~x=|v_rec_#in~x_1|} AuxVars[] AssignedVars[rec_~x] 43#L10 [52] L10-->L12: Formula: (> v_rec_~x_3 0) InVars {rec_~x=v_rec_~x_3} OutVars{rec_~x=v_rec_~x_3} AuxVars[] AssignedVars[] 44#L12 [57] L12-->L13: Formula: (= (mod v_rec_~x_4 2) 0) InVars {rec_~x=v_rec_~x_4} OutVars{rec_~x=v_rec_~x_4} AuxVars[] AssignedVars[] 39#L13 [33] L13-->recENTRY: Formula: (= |v_rec_#in~xInParam_1| (let ((.cse0 (div v_rec_~x_10 2))) (ite (and (not (= 0 (mod v_rec_~x_10 2))) (< v_rec_~x_10 0)) (+ .cse0 1) .cse0))) InVars {rec_~x=v_rec_~x_10} OutVars{rec_#in~x=|v_rec_#in~xInParam_1|} AuxVars[] AssignedVars[rec_#in~x]< 42#recENTRY [2020-06-22 02:23:12,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:12,997 INFO L82 PathProgramCache]: Analyzing trace with hash 2275, now seen corresponding path program 2 times [2020-06-22 02:23:12,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:12,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:12,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:12,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:23:12,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:13,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:13,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1928605, now seen corresponding path program 1 times [2020-06-22 02:23:13,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:13,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:13,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:13,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:23:13,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:13,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:13,020 INFO L82 PathProgramCache]: Analyzing trace with hash 2102015359, now seen corresponding path program 1 times [2020-06-22 02:23:13,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:13,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:13,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:13,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:23:13,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:13,138 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:23:13,140 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:23:13,140 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:23:13,140 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:23:13,140 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 02:23:13,140 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:23:13,140 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:23:13,140 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:23:13,141 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 02:23:13,141 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:23:13,141 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:23:13,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:23:13,168 INFO 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 02:23:13,176 INFO 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 02:23:13,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:23:13,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:23:13,202 INFO 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 02:23:13,205 INFO 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 02:23:13,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:23:13,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:23:13,306 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:23:13,307 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 02:23:13,314 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:23:13,314 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:23:13,323 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:23:13,323 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec_#t~ret0=0} Honda state: {rec_#t~ret0=0} 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 02:23:13,353 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:23:13,353 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:23:13,358 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:23:13,358 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec_#t~ret2=0} Honda state: {rec_#t~ret2=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 02:23:13,388 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:23:13,388 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:23:13,393 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:23:13,394 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec_~x=0} Honda state: {rec_~x=0} 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 02:23:13,420 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:23:13,420 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 02:23:13,454 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 02:23:13,454 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:23:13,494 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 02:23:13,497 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:23:13,497 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:23:13,497 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:23:13,497 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:23:13,497 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 02:23:13,497 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 02:23:13,498 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:23:13,498 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:23:13,498 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 02:23:13,498 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:23:13,498 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:23:13,500 INFO 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 02:23:13,502 INFO 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 02:23:13,505 INFO 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 02:23:13,507 INFO 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 02:23:13,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:23:13,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:23:13,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:23:13,522 INFO 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 02:23:13,524 INFO 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 02:23:13,614 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:23:13,620 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 02:23:13,622 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 02:23:13,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:13,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:13,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:13,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:13,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:23:13,627 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:23:13,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:13,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:13,630 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 02:23:13,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:13,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:13,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:13,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:13,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:23:13,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:23:13,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:13,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:13,633 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 02:23:13,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:13,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:13,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:13,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:13,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:23:13,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:23:13,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:13,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:13,637 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 02:23:13,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:13,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:13,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:13,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:13,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:23:13,639 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:23:13,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:13,648 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 02:23:13,655 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 02:23:13,656 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 02:23:13,658 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 02:23:13,658 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 02:23:13,658 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 02:23:13,659 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec_#in~x) = 1*rec_#in~x Supporting invariants [] [2020-06-22 02:23:13,660 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 02:23:13,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:23:13,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:23:13,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:23:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:23:13,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 02:23:13,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:23:13,799 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 02:23:13,810 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 02:23:13,813 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 02:23:13,814 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 13 states and 18 transitions. cyclomatic complexity: 6 Second operand 4 states. [2020-06-22 02:23:13,938 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 13 states and 18 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 51 states and 70 transitions. Complement of second has 20 states. [2020-06-22 02:23:13,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-06-22 02:23:13,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 02:23:13,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2020-06-22 02:23:13,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 2 letters. Loop has 4 letters. [2020-06-22 02:23:13,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:23:13,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 6 letters. Loop has 4 letters. [2020-06-22 02:23:13,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:23:13,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 2 letters. Loop has 8 letters. [2020-06-22 02:23:13,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:23:13,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 70 transitions. [2020-06-22 02:23:13,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 02:23:13,960 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 27 states and 38 transitions. [2020-06-22 02:23:13,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-06-22 02:23:13,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-06-22 02:23:13,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 38 transitions. [2020-06-22 02:23:13,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 02:23:13,961 INFO L706 BuchiCegarLoop]: Abstraction has 27 states and 38 transitions. [2020-06-22 02:23:13,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 38 transitions. [2020-06-22 02:23:13,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2020-06-22 02:23:13,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 02:23:13,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2020-06-22 02:23:13,965 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2020-06-22 02:23:13,965 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2020-06-22 02:23:13,965 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 02:23:13,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. [2020-06-22 02:23:13,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 02:23:13,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:23:13,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:23:13,967 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 02:23:13,967 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 02:23:13,967 INFO L794 eck$LassoCheckResult]: Stem: 179#ULTIMATE.startENTRY [41] ULTIMATE.startENTRY-->L23: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 166#L23 [43] L23-->recENTRY: Formula: (= |v_rec_#in~xInParam_4| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec_#in~x=|v_rec_#in~xInParam_4|} AuxVars[] AssignedVars[rec_#in~x]< 169#recENTRY [32] recENTRY-->L10: Formula: (= v_rec_~x_1 |v_rec_#in~x_1|) InVars {rec_#in~x=|v_rec_#in~x_1|} OutVars{rec_~x=v_rec_~x_1, rec_#in~x=|v_rec_#in~x_1|} AuxVars[] AssignedVars[rec_~x] 171#L10 [52] L10-->L12: Formula: (> v_rec_~x_3 0) InVars {rec_~x=v_rec_~x_3} OutVars{rec_~x=v_rec_~x_3} AuxVars[] AssignedVars[] 174#L12 [60] L12-->L15: Formula: (let ((.cse0 (mod v_rec_~x_7 2)) (.cse1 (+ v_rec_~x_7 1))) (and (> 0 (+ .cse0 (- 2))) (= v_rec_~x_6 .cse1) (< 0 .cse0) (= |v_rec_#t~pre1_1| .cse1))) InVars {rec_~x=v_rec_~x_7} OutVars{rec_~x=v_rec_~x_6, rec_#t~pre1=|v_rec_#t~pre1_1|} AuxVars[] AssignedVars[rec_~x, rec_#t~pre1] 164#L15 [2020-06-22 02:23:13,968 INFO L796 eck$LassoCheckResult]: Loop: 164#L15 [38] L15-->recENTRY: Formula: (= |v_rec_#in~xInParam_2| |v_rec_#t~pre1_4|) InVars {rec_#t~pre1=|v_rec_#t~pre1_4|} OutVars{rec_#in~x=|v_rec_#in~xInParam_2|} AuxVars[] AssignedVars[rec_#in~x]< 173#recENTRY [32] recENTRY-->L10: Formula: (= v_rec_~x_1 |v_rec_#in~x_1|) InVars {rec_#in~x=|v_rec_#in~x_1|} OutVars{rec_~x=v_rec_~x_1, rec_#in~x=|v_rec_#in~x_1|} AuxVars[] AssignedVars[rec_~x] 182#L10 [52] L10-->L12: Formula: (> v_rec_~x_3 0) InVars {rec_~x=v_rec_~x_3} OutVars{rec_~x=v_rec_~x_3} AuxVars[] AssignedVars[] 181#L12 [59] L12-->L15: Formula: (let ((.cse0 (+ v_rec_~x_7 1))) (and (= v_rec_~x_6 .cse0) (< 0 (mod v_rec_~x_7 2)) (= |v_rec_#t~pre1_1| .cse0) (>= v_rec_~x_7 0))) InVars {rec_~x=v_rec_~x_7} OutVars{rec_~x=v_rec_~x_6, rec_#t~pre1=|v_rec_#t~pre1_1|} AuxVars[] AssignedVars[rec_~x, rec_#t~pre1] 164#L15 [2020-06-22 02:23:13,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:13,968 INFO L82 PathProgramCache]: Analyzing trace with hash 67806949, now seen corresponding path program 1 times [2020-06-22 02:23:13,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:13,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:13,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:13,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:23:13,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:13,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:13,979 INFO L82 PathProgramCache]: Analyzing trace with hash 2088002, now seen corresponding path program 1 times [2020-06-22 02:23:13,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:13,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:13,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:13,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:23:13,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:13,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:13,990 INFO L82 PathProgramCache]: Analyzing trace with hash 519336230, now seen corresponding path program 1 times [2020-06-22 02:23:13,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:13,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:13,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:13,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:23:13,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:23:14,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:23:14,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:23:14,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 02:23:14,162 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:23:14,162 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:23:14,162 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:23:14,163 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:23:14,163 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 02:23:14,163 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:23:14,163 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:23:14,163 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:23:14,163 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 02:23:14,163 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:23:14,163 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:23:14,165 INFO 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 02:23:14,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:23:14,189 INFO 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 02:23:14,192 INFO 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 02:23:14,194 INFO 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 02:23:14,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:23:14,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:23:14,291 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:23:14,292 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 02:23:14,297 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:23:14,297 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:23:14,302 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:23:14,302 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec_~store~0=0} Honda state: {rec_~store~0=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 02:23:14,329 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:23:14,330 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 02:23:14,367 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 02:23:14,368 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:23:18,434 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 02:23:18,438 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:23:18,439 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:23:18,439 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:23:18,439 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:23:18,439 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 02:23:18,439 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 02:23:18,439 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:23:18,439 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:23:18,439 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 02:23:18,439 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:23:18,440 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:23:18,441 INFO 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 02:23:18,453 INFO 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 02:23:18,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:23:18,457 INFO 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 02:23:18,458 INFO 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 02:23:18,460 INFO 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 02:23:18,462 INFO 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 02:23:18,542 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:23:18,543 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 02:23:18,543 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 02:23:18,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:18,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:23:18,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:23:18,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,556 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 02:23:18,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:18,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:23:18,557 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:23:18,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,559 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 02:23:18,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:18,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:23:18,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:23:18,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,562 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 02:23:18,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:18,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:23:18,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:23:18,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,564 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 02:23:18,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:18,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:23:18,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:23:18,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,567 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 02:23:18,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:18,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:23:18,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:23:18,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,570 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 02:23:18,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:18,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:23:18,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:23:18,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,572 INFO L497 LassoAnalysis]: Using template '2-nested'. [2020-06-22 02:23:18,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:23:18,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:18,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,574 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 02:23:18,575 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 02:23:18,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:23:18,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:18,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,589 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 02:23:18,590 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 02:23:18,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,591 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 02:23:18,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:18,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,592 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 02:23:18,593 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 02:23:18,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:23:18,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:18,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,595 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 02:23:18,596 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 02:23:18,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,598 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 02:23:18,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:18,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,600 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 02:23:18,600 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 02:23:18,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,601 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 02:23:18,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:18,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,602 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 02:23:18,603 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 02:23:18,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,604 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 02:23:18,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:18,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,605 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 02:23:18,606 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 02:23:18,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,607 INFO L497 LassoAnalysis]: Using template '3-nested'. [2020-06-22 02:23:18,607 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 02:23:18,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:18,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,608 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 02:23:18,610 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 02:23:18,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,625 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 02:23:18,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:18,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,626 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 02:23:18,627 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 02:23:18,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,628 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 02:23:18,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:18,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,629 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 02:23:18,630 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 02:23:18,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,631 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 02:23:18,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:18,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,632 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 02:23:18,633 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 02:23:18,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,634 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 02:23:18,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:18,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,635 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 02:23:18,636 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 02:23:18,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,637 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 02:23:18,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:18,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,638 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 02:23:18,639 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 02:23:18,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,640 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 02:23:18,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:18,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,641 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 02:23:18,642 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 02:23:18,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,643 INFO L497 LassoAnalysis]: Using template '4-nested'. [2020-06-22 02:23:18,643 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 02:23:18,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:18,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,645 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 02:23:18,646 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 02:23:18,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,662 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 02:23:18,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:18,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,663 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 02:23:18,664 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 02:23:18,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,665 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 02:23:18,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:18,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,666 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 02:23:18,667 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 02:23:18,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,669 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 02:23:18,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:18,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,670 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 02:23:18,670 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 02:23:18,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:23:18,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:18,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,673 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 02:23:18,673 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 02:23:18,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:23:18,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:18,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,676 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 02:23:18,676 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 02:23:18,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:23:18,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:18,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,679 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 02:23:18,680 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 02:23:18,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,681 INFO L497 LassoAnalysis]: Using template '2-phase'. [2020-06-22 02:23:18,681 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 02:23:18,682 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 02:23:18,682 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 02:23:18,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,683 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 02:23:18,685 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 02:23:18,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,727 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 02:23:18,728 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 02:23:18,728 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 02:23:18,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,728 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 02:23:18,729 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 02:23:18,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,731 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 02:23:18,732 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 02:23:18,732 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 02:23:18,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,732 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 02:23:18,733 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 02:23:18,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,734 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 02:23:18,735 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 02:23:18,735 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 02:23:18,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,735 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 02:23:18,736 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 02:23:18,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,738 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 02:23:18,738 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 02:23:18,738 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 02:23:18,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,739 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 02:23:18,740 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 02:23:18,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,741 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 02:23:18,742 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 02:23:18,742 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 02:23:18,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,742 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 02:23:18,743 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 02:23:18,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,744 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 02:23:18,745 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 02:23:18,745 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 02:23:18,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,746 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 02:23:18,746 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 02:23:18,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,747 INFO L497 LassoAnalysis]: Using template '3-phase'. [2020-06-22 02:23:18,748 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 02:23:18,748 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 02:23:18,748 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 02:23:18,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,749 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 02:23:18,751 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 02:23:18,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,804 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 02:23:18,805 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 02:23:18,806 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 02:23:18,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,807 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 02:23:18,808 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 02:23:18,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,811 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 02:23:18,811 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 02:23:18,812 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 02:23:18,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,812 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 02:23:18,813 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 02:23:18,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:23:18,816 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 02:23:18,816 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 02:23:18,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,817 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 02:23:18,818 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 02:23:18,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,821 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 02:23:18,821 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 02:23:18,821 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 02:23:18,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,822 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 02:23:18,823 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 02:23:18,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,826 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 02:23:18,826 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 02:23:18,826 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 02:23:18,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,827 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 02:23:18,828 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 02:23:18,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,830 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 02:23:18,831 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 02:23:18,831 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 02:23:18,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,831 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 02:23:18,832 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 02:23:18,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,834 INFO L497 LassoAnalysis]: Using template '4-phase'. [2020-06-22 02:23:18,835 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 02:23:18,835 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 02:23:18,835 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 02:23:18,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,836 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 02:23:18,839 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 02:23:18,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:23:18,936 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 02:23:18,936 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 02:23:18,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,937 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 02:23:18,938 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 02:23:18,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,940 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 02:23:18,941 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 02:23:18,941 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 02:23:18,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,941 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 02:23:18,943 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 02:23:18,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,944 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 02:23:18,945 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 02:23:18,945 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 02:23:18,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,946 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 02:23:18,947 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 02:23:18,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,949 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 02:23:18,949 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 02:23:18,949 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 02:23:18,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,950 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 02:23:18,951 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 02:23:18,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,952 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 02:23:18,953 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 02:23:18,953 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 02:23:18,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,954 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 02:23:18,955 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 02:23:18,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,956 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 02:23:18,957 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 02:23:18,957 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 02:23:18,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,958 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 02:23:18,959 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 02:23:18,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,960 INFO L497 LassoAnalysis]: Using template '2-lex'. [2020-06-22 02:23:18,961 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 02:23:18,961 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 02:23:18,961 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 02:23:18,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,962 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 02:23:18,963 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 02:23:18,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,975 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 02:23:18,975 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 02:23:18,975 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 02:23:18,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,976 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 02:23:18,977 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 02:23:18,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,979 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 02:23:18,980 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 02:23:18,980 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 02:23:18,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,981 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 02:23:18,981 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 02:23:18,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,984 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 02:23:18,984 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 02:23:18,984 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 02:23:18,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,985 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 02:23:18,985 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 02:23:18,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,988 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 02:23:18,988 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 02:23:18,988 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 02:23:18,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,989 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 02:23:18,989 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 02:23:18,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,992 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 02:23:18,992 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 02:23:18,992 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 02:23:18,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,993 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 02:23:18,993 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 02:23:18,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:18,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:18,996 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 02:23:18,996 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 02:23:18,996 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 02:23:18,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:18,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:18,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:18,997 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 02:23:18,998 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 02:23:18,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:19,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:19,000 INFO L497 LassoAnalysis]: Using template '3-lex'. [2020-06-22 02:23:19,000 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 02:23:19,001 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 02:23:19,001 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 02:23:19,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:19,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:19,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:19,001 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 02:23:19,004 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 02:23:19,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:19,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:19,036 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 02:23:19,037 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 02:23:19,037 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 02:23:19,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:19,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:19,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:19,037 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 02:23:19,038 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 02:23:19,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:19,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:19,043 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 02:23:19,043 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 02:23:19,043 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 02:23:19,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:19,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:19,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:19,044 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 02:23:19,045 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 02:23:19,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:19,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:19,049 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 02:23:19,050 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 02:23:19,050 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 02:23:19,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:19,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:19,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:19,051 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 02:23:19,052 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 02:23:19,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:19,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:19,056 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 02:23:19,056 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 02:23:19,056 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 02:23:19,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:19,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:19,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:19,057 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 02:23:19,058 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 02:23:19,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:19,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:19,062 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 02:23:19,062 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 02:23:19,062 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 02:23:19,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:19,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:19,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:19,063 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 02:23:19,064 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 02:23:19,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:19,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:19,068 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 02:23:19,069 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 02:23:19,069 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 02:23:19,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:19,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:19,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:19,069 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 02:23:19,070 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 02:23:19,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:19,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:19,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 02:23:19,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 02:23:19,075 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. cyclomatic complexity: 10 Second operand 5 states. [2020-06-22 02:23:19,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:23:19,162 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2020-06-22 02:23:19,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 02:23:19,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 40 transitions. [2020-06-22 02:23:19,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 02:23:19,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 40 transitions. [2020-06-22 02:23:19,172 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2020-06-22 02:23:19,172 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2020-06-22 02:23:19,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 40 transitions. [2020-06-22 02:23:19,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 02:23:19,172 INFO L706 BuchiCegarLoop]: Abstraction has 29 states and 40 transitions. [2020-06-22 02:23:19,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 40 transitions. [2020-06-22 02:23:19,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2020-06-22 02:23:19,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 02:23:19,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2020-06-22 02:23:19,177 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2020-06-22 02:23:19,178 INFO L609 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2020-06-22 02:23:19,178 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 02:23:19,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2020-06-22 02:23:19,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 02:23:19,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:23:19,179 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:23:19,180 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 02:23:19,180 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:23:19,181 INFO L794 eck$LassoCheckResult]: Stem: 245#ULTIMATE.startENTRY [41] ULTIMATE.startENTRY-->L23: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 230#L23 [43] L23-->recENTRY: Formula: (= |v_rec_#in~xInParam_4| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec_#in~x=|v_rec_#in~xInParam_4|} AuxVars[] AssignedVars[rec_#in~x]< 248#recENTRY [32] recENTRY-->L10: Formula: (= v_rec_~x_1 |v_rec_#in~x_1|) InVars {rec_#in~x=|v_rec_#in~x_1|} OutVars{rec_~x=v_rec_~x_1, rec_#in~x=|v_rec_#in~x_1|} AuxVars[] AssignedVars[rec_~x] 237#L10 [52] L10-->L12: Formula: (> v_rec_~x_3 0) InVars {rec_~x=v_rec_~x_3} OutVars{rec_~x=v_rec_~x_3} AuxVars[] AssignedVars[] 238#L12 [60] L12-->L15: Formula: (let ((.cse0 (mod v_rec_~x_7 2)) (.cse1 (+ v_rec_~x_7 1))) (and (> 0 (+ .cse0 (- 2))) (= v_rec_~x_6 .cse1) (< 0 .cse0) (= |v_rec_#t~pre1_1| .cse1))) InVars {rec_~x=v_rec_~x_7} OutVars{rec_~x=v_rec_~x_6, rec_#t~pre1=|v_rec_#t~pre1_1|} AuxVars[] AssignedVars[rec_~x, rec_#t~pre1] 239#L15 [2020-06-22 02:23:19,181 INFO L796 eck$LassoCheckResult]: Loop: 239#L15 [38] L15-->recENTRY: Formula: (= |v_rec_#in~xInParam_2| |v_rec_#t~pre1_4|) InVars {rec_#t~pre1=|v_rec_#t~pre1_4|} OutVars{rec_#in~x=|v_rec_#in~xInParam_2|} AuxVars[] AssignedVars[rec_#in~x]< 243#recENTRY [32] recENTRY-->L10: Formula: (= v_rec_~x_1 |v_rec_#in~x_1|) InVars {rec_#in~x=|v_rec_#in~x_1|} OutVars{rec_~x=v_rec_~x_1, rec_#in~x=|v_rec_#in~x_1|} AuxVars[] AssignedVars[rec_~x] 251#L10 [46] L10-->recFINAL: Formula: (and (<= v_rec_~x_2 0) (= |v_rec_#res_1| v_rec_~x_2)) InVars {rec_~x=v_rec_~x_2} OutVars{rec_#res=|v_rec_#res_1|, rec_~x=v_rec_~x_2} AuxVars[] AssignedVars[rec_#res] 250#recFINAL [44] recFINAL-->recEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 249#recEXIT >[49] recEXIT-->L15-1: AOR: Formula: (= |v_rec_#t~ret2_4| |v_rec_#resOutParam_2|) InVars {rec_#res=|v_rec_#resOutParam_2|} OutVars{rec_#t~ret2=|v_rec_#t~ret2_4|} AuxVars[] AssignedVars[rec_#t~ret2] LVA: Formula: (= |v_rec_#in~xInParam_2| |v_rec_#t~pre1_4|) InVars {rec_#t~pre1=|v_rec_#t~pre1_4|} OutVars{rec_#in~x=|v_rec_#in~xInParam_2|} AuxVars[] AssignedVars[rec_#in~x] 227#L15-1 [31] L15-1-->L16: Formula: (let ((.cse0 (+ v_rec_~x_9 (- 1)))) (and (= v_rec_~store~0_1 |v_rec_#t~ret2_3|) (= |v_rec_#t~pre3_1| .cse0) (= v_rec_~x_8 .cse0))) InVars {rec_#t~ret2=|v_rec_#t~ret2_3|, rec_~x=v_rec_~x_9} OutVars{rec_~x=v_rec_~x_8, rec_~store~0=v_rec_~store~0_1, rec_#t~pre3=|v_rec_#t~pre3_1|, rec_#t~ret2=|v_rec_#t~ret2_2|, rec_#t~pre1=|v_rec_#t~pre1_3|} AuxVars[] AssignedVars[rec_~x, rec_~store~0, rec_#t~pre3, rec_#t~ret2, rec_#t~pre1] 229#L16 [37] L16-->recENTRY: Formula: (= |v_rec_#in~xInParam_3| |v_rec_#t~pre3_4|) InVars {rec_#t~pre3=|v_rec_#t~pre3_4|} OutVars{rec_#in~x=|v_rec_#in~xInParam_3|} AuxVars[] AssignedVars[rec_#in~x]< 233#recENTRY [32] recENTRY-->L10: Formula: (= v_rec_~x_1 |v_rec_#in~x_1|) InVars {rec_#in~x=|v_rec_#in~x_1|} OutVars{rec_~x=v_rec_~x_1, rec_#in~x=|v_rec_#in~x_1|} AuxVars[] AssignedVars[rec_~x] 234#L10 [52] L10-->L12: Formula: (> v_rec_~x_3 0) InVars {rec_~x=v_rec_~x_3} OutVars{rec_~x=v_rec_~x_3} AuxVars[] AssignedVars[] 253#L12 [59] L12-->L15: Formula: (let ((.cse0 (+ v_rec_~x_7 1))) (and (= v_rec_~x_6 .cse0) (< 0 (mod v_rec_~x_7 2)) (= |v_rec_#t~pre1_1| .cse0) (>= v_rec_~x_7 0))) InVars {rec_~x=v_rec_~x_7} OutVars{rec_~x=v_rec_~x_6, rec_#t~pre1=|v_rec_#t~pre1_1|} AuxVars[] AssignedVars[rec_~x, rec_#t~pre1] 239#L15 [2020-06-22 02:23:19,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:19,181 INFO L82 PathProgramCache]: Analyzing trace with hash 67806949, now seen corresponding path program 2 times [2020-06-22 02:23:19,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:19,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:19,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:19,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:23:19,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:19,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:19,189 INFO L82 PathProgramCache]: Analyzing trace with hash 2009414697, now seen corresponding path program 1 times [2020-06-22 02:23:19,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:19,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:19,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:19,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:23:19,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:19,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:19,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1592235533, now seen corresponding path program 1 times [2020-06-22 02:23:19,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:19,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:19,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:19,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:23:19,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:19,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:23:19,237 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 02:23:19,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:23:19,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 02:23:19,406 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:23:19,406 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:23:19,406 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:23:19,407 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:23:19,407 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 02:23:19,407 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:23:19,407 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:23:19,407 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:23:19,407 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 02:23:19,407 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:23:19,407 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:23:19,408 INFO 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 02:23:19,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:23:19,423 INFO 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 02:23:19,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:23:19,426 INFO 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 02:23:19,427 INFO 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 02:23:19,428 INFO 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 02:23:19,518 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:23:19,518 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 02:23:19,524 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:23:19,524 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 02:23:19,556 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 02:23:19,557 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:23:20,008 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 02:23:20,011 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:23:20,011 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:23:20,012 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:23:20,012 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:23:20,012 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 02:23:20,012 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 02:23:20,012 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:23:20,012 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:23:20,012 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 02:23:20,012 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:23:20,012 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:23:20,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:23:20,016 INFO 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 02:23:20,029 INFO 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 02:23:20,031 INFO 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 02:23:20,033 INFO 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 02:23:20,034 INFO 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 02:23:20,036 INFO 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 02:23:20,130 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:23:20,131 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 02:23:20,131 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 02:23:20,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:20,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:20,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:20,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:20,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:23:20,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:23:20,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:20,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:20,134 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 02:23:20,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:20,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:20,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:20,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:20,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:23:20,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:23:20,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:20,139 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 02:23:20,141 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 02:23:20,141 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 02:23:20,142 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 02:23:20,142 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 02:23:20,142 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 02:23:20,142 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec_#t~pre1) = -1*rec_#t~pre1 + 1 Supporting invariants [] [2020-06-22 02:23:20,143 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 02:23:20,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:23:20,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:23:20,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:23:20,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:23:20,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 02:23:20,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:23:20,300 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 02:23:20,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:23:20,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 02:23:20,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:23:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:23:20,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 02:23:20,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:23:20,386 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 9 predicates after loop cannibalization [2020-06-22 02:23:20,386 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 02:23:20,386 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 27 states and 36 transitions. cyclomatic complexity: 11 Second operand 7 states. [2020-06-22 02:23:21,597 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 27 states and 36 transitions. cyclomatic complexity: 11. Second operand 7 states. Result 5594 states and 11312 transitions. Complement of second has 2046 states. [2020-06-22 02:23:21,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 1 stem states 15 non-accepting loop states 2 accepting loop states [2020-06-22 02:23:21,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 02:23:21,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 117 transitions. [2020-06-22 02:23:21,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 117 transitions. Stem has 5 letters. Loop has 10 letters. [2020-06-22 02:23:21,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:23:21,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 117 transitions. Stem has 15 letters. Loop has 10 letters. [2020-06-22 02:23:21,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:23:21,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 117 transitions. Stem has 5 letters. Loop has 20 letters. [2020-06-22 02:23:21,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:23:21,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5594 states and 11312 transitions. [2020-06-22 02:23:21,809 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 59 [2020-06-22 02:23:21,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5594 states to 295 states and 446 transitions. [2020-06-22 02:23:21,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 251 [2020-06-22 02:23:21,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 259 [2020-06-22 02:23:21,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 295 states and 446 transitions. [2020-06-22 02:23:21,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 02:23:21,827 INFO L706 BuchiCegarLoop]: Abstraction has 295 states and 446 transitions. [2020-06-22 02:23:21,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states and 446 transitions. [2020-06-22 02:23:21,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 157. [2020-06-22 02:23:21,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-06-22 02:23:21,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 206 transitions. [2020-06-22 02:23:21,856 INFO L729 BuchiCegarLoop]: Abstraction has 157 states and 206 transitions. [2020-06-22 02:23:21,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 02:23:21,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-06-22 02:23:21,856 INFO L87 Difference]: Start difference. First operand 157 states and 206 transitions. Second operand 6 states. [2020-06-22 02:23:21,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:23:21,959 INFO L93 Difference]: Finished difference Result 110 states and 155 transitions. [2020-06-22 02:23:21,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 02:23:21,964 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 110 states and 155 transitions. [2020-06-22 02:23:21,966 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 [2020-06-22 02:23:21,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 110 states to 102 states and 147 transitions. [2020-06-22 02:23:21,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2020-06-22 02:23:21,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2020-06-22 02:23:21,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 147 transitions. [2020-06-22 02:23:21,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 02:23:21,970 INFO L706 BuchiCegarLoop]: Abstraction has 102 states and 147 transitions. [2020-06-22 02:23:21,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 147 transitions. [2020-06-22 02:23:21,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 84. [2020-06-22 02:23:21,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-06-22 02:23:21,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 111 transitions. [2020-06-22 02:23:21,979 INFO L729 BuchiCegarLoop]: Abstraction has 84 states and 111 transitions. [2020-06-22 02:23:21,979 INFO L609 BuchiCegarLoop]: Abstraction has 84 states and 111 transitions. [2020-06-22 02:23:21,979 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 02:23:21,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 111 transitions. [2020-06-22 02:23:21,980 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 [2020-06-22 02:23:21,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:23:21,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:23:21,981 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 02:23:21,981 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:23:21,981 INFO L794 eck$LassoCheckResult]: Stem: 8347#ULTIMATE.startENTRY [41] ULTIMATE.startENTRY-->L23: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 8338#L23 [43] L23-->recENTRY: Formula: (= |v_rec_#in~xInParam_4| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec_#in~x=|v_rec_#in~xInParam_4|} AuxVars[] AssignedVars[rec_#in~x]< 8357#recENTRY [32] recENTRY-->L10: Formula: (= v_rec_~x_1 |v_rec_#in~x_1|) InVars {rec_#in~x=|v_rec_#in~x_1|} OutVars{rec_~x=v_rec_~x_1, rec_#in~x=|v_rec_#in~x_1|} AuxVars[] AssignedVars[rec_~x] 8332#L10 [52] L10-->L12: Formula: (> v_rec_~x_3 0) InVars {rec_~x=v_rec_~x_3} OutVars{rec_~x=v_rec_~x_3} AuxVars[] AssignedVars[] 8383#L12 [59] L12-->L15: Formula: (let ((.cse0 (+ v_rec_~x_7 1))) (and (= v_rec_~x_6 .cse0) (< 0 (mod v_rec_~x_7 2)) (= |v_rec_#t~pre1_1| .cse0) (>= v_rec_~x_7 0))) InVars {rec_~x=v_rec_~x_7} OutVars{rec_~x=v_rec_~x_6, rec_#t~pre1=|v_rec_#t~pre1_1|} AuxVars[] AssignedVars[rec_~x, rec_#t~pre1] 8384#L15 [2020-06-22 02:23:21,982 INFO L796 eck$LassoCheckResult]: Loop: 8384#L15 [38] L15-->recENTRY: Formula: (= |v_rec_#in~xInParam_2| |v_rec_#t~pre1_4|) InVars {rec_#t~pre1=|v_rec_#t~pre1_4|} OutVars{rec_#in~x=|v_rec_#in~xInParam_2|} AuxVars[] AssignedVars[rec_#in~x]< 8390#recENTRY [32] recENTRY-->L10: Formula: (= v_rec_~x_1 |v_rec_#in~x_1|) InVars {rec_#in~x=|v_rec_#in~x_1|} OutVars{rec_~x=v_rec_~x_1, rec_#in~x=|v_rec_#in~x_1|} AuxVars[] AssignedVars[rec_~x] 8389#L10 [52] L10-->L12: Formula: (> v_rec_~x_3 0) InVars {rec_~x=v_rec_~x_3} OutVars{rec_~x=v_rec_~x_3} AuxVars[] AssignedVars[] 8388#L12 [57] L12-->L13: Formula: (= (mod v_rec_~x_4 2) 0) InVars {rec_~x=v_rec_~x_4} OutVars{rec_~x=v_rec_~x_4} AuxVars[] AssignedVars[] 8336#L13 [33] L13-->recENTRY: Formula: (= |v_rec_#in~xInParam_1| (let ((.cse0 (div v_rec_~x_10 2))) (ite (and (not (= 0 (mod v_rec_~x_10 2))) (< v_rec_~x_10 0)) (+ .cse0 1) .cse0))) InVars {rec_~x=v_rec_~x_10} OutVars{rec_#in~x=|v_rec_#in~xInParam_1|} AuxVars[] AssignedVars[rec_#in~x]< 8337#recENTRY [32] recENTRY-->L10: Formula: (= v_rec_~x_1 |v_rec_#in~x_1|) InVars {rec_#in~x=|v_rec_#in~x_1|} OutVars{rec_~x=v_rec_~x_1, rec_#in~x=|v_rec_#in~x_1|} AuxVars[] AssignedVars[rec_~x] 8385#L10 [46] L10-->recFINAL: Formula: (and (<= v_rec_~x_2 0) (= |v_rec_#res_1| v_rec_~x_2)) InVars {rec_~x=v_rec_~x_2} OutVars{rec_#res=|v_rec_#res_1|, rec_~x=v_rec_~x_2} AuxVars[] AssignedVars[rec_#res] 8387#recFINAL [44] recFINAL-->recEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 8395#recEXIT >[48] recEXIT-->L13-1: AOR: Formula: (= |v_rec_#t~ret0_4| |v_rec_#resOutParam_1|) InVars {rec_#res=|v_rec_#resOutParam_1|} OutVars{rec_#t~ret0=|v_rec_#t~ret0_4|} AuxVars[] AssignedVars[rec_#t~ret0] LVA: Formula: (= |v_rec_#in~xInParam_1| (let ((.cse0 (div v_rec_~x_10 2))) (ite (and (not (= 0 (mod v_rec_~x_10 2))) (< v_rec_~x_10 0)) (+ .cse0 1) .cse0))) InVars {rec_~x=v_rec_~x_10} OutVars{rec_#in~x=|v_rec_#in~xInParam_1|} AuxVars[] AssignedVars[rec_#in~x] 8394#L13-1 [36] L13-1-->recFINAL: Formula: (= |v_rec_#res_2| |v_rec_#t~ret0_3|) InVars {rec_#t~ret0=|v_rec_#t~ret0_3|} OutVars{rec_#res=|v_rec_#res_2|, rec_#t~ret0=|v_rec_#t~ret0_2|} AuxVars[] AssignedVars[rec_#t~ret0, rec_#res] 8393#recFINAL [44] recFINAL-->recEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 8392#recEXIT >[49] recEXIT-->L15-1: AOR: Formula: (= |v_rec_#t~ret2_4| |v_rec_#resOutParam_2|) InVars {rec_#res=|v_rec_#resOutParam_2|} OutVars{rec_#t~ret2=|v_rec_#t~ret2_4|} AuxVars[] AssignedVars[rec_#t~ret2] LVA: Formula: (= |v_rec_#in~xInParam_2| |v_rec_#t~pre1_4|) InVars {rec_#t~pre1=|v_rec_#t~pre1_4|} OutVars{rec_#in~x=|v_rec_#in~xInParam_2|} AuxVars[] AssignedVars[rec_#in~x] 8391#L15-1 [31] L15-1-->L16: Formula: (let ((.cse0 (+ v_rec_~x_9 (- 1)))) (and (= v_rec_~store~0_1 |v_rec_#t~ret2_3|) (= |v_rec_#t~pre3_1| .cse0) (= v_rec_~x_8 .cse0))) InVars {rec_#t~ret2=|v_rec_#t~ret2_3|, rec_~x=v_rec_~x_9} OutVars{rec_~x=v_rec_~x_8, rec_~store~0=v_rec_~store~0_1, rec_#t~pre3=|v_rec_#t~pre3_1|, rec_#t~ret2=|v_rec_#t~ret2_2|, rec_#t~pre1=|v_rec_#t~pre1_3|} AuxVars[] AssignedVars[rec_~x, rec_~store~0, rec_#t~pre3, rec_#t~ret2, rec_#t~pre1] 8335#L16 [37] L16-->recENTRY: Formula: (= |v_rec_#in~xInParam_3| |v_rec_#t~pre3_4|) InVars {rec_#t~pre3=|v_rec_#t~pre3_4|} OutVars{rec_#in~x=|v_rec_#in~xInParam_3|} AuxVars[] AssignedVars[rec_#in~x]< 8337#recENTRY [32] recENTRY-->L10: Formula: (= v_rec_~x_1 |v_rec_#in~x_1|) InVars {rec_#in~x=|v_rec_#in~x_1|} OutVars{rec_~x=v_rec_~x_1, rec_#in~x=|v_rec_#in~x_1|} AuxVars[] AssignedVars[rec_~x] 8385#L10 [52] L10-->L12: Formula: (> v_rec_~x_3 0) InVars {rec_~x=v_rec_~x_3} OutVars{rec_~x=v_rec_~x_3} AuxVars[] AssignedVars[] 8386#L12 [59] L12-->L15: Formula: (let ((.cse0 (+ v_rec_~x_7 1))) (and (= v_rec_~x_6 .cse0) (< 0 (mod v_rec_~x_7 2)) (= |v_rec_#t~pre1_1| .cse0) (>= v_rec_~x_7 0))) InVars {rec_~x=v_rec_~x_7} OutVars{rec_~x=v_rec_~x_6, rec_#t~pre1=|v_rec_#t~pre1_1|} AuxVars[] AssignedVars[rec_~x, rec_#t~pre1] 8384#L15 [2020-06-22 02:23:21,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:21,982 INFO L82 PathProgramCache]: Analyzing trace with hash 67806948, now seen corresponding path program 1 times [2020-06-22 02:23:21,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:21,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:21,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:21,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:23:21,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:21,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:21,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1019409301, now seen corresponding path program 1 times [2020-06-22 02:23:21,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:21,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:21,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:21,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:23:21,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:23:22,039 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 02:23:22,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:23:22,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 02:23:22,039 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 02:23:22,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 02:23:22,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-06-22 02:23:22,040 INFO L87 Difference]: Start difference. First operand 84 states and 111 transitions. cyclomatic complexity: 30 Second operand 6 states. [2020-06-22 02:23:22,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:23:22,095 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2020-06-22 02:23:22,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 02:23:22,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 43 transitions. [2020-06-22 02:23:22,099 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2020-06-22 02:23:22,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 32 states and 39 transitions. [2020-06-22 02:23:22,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-06-22 02:23:22,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-06-22 02:23:22,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 39 transitions. [2020-06-22 02:23:22,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 02:23:22,100 INFO L706 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-06-22 02:23:22,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 39 transitions. [2020-06-22 02:23:22,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 17. [2020-06-22 02:23:22,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 02:23:22,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2020-06-22 02:23:22,102 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2020-06-22 02:23:22,102 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2020-06-22 02:23:22,102 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 02:23:22,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2020-06-22 02:23:22,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 02:23:22,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:23:22,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:23:22,103 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 02:23:22,103 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2020-06-22 02:23:22,103 INFO L794 eck$LassoCheckResult]: Stem: 8465#ULTIMATE.startENTRY [41] ULTIMATE.startENTRY-->L23: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 8466#L23 [43] L23-->recENTRY: Formula: (= |v_rec_#in~xInParam_4| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec_#in~x=|v_rec_#in~xInParam_4|} AuxVars[] AssignedVars[rec_#in~x]< 8471#recENTRY [32] recENTRY-->L10: Formula: (= v_rec_~x_1 |v_rec_#in~x_1|) InVars {rec_#in~x=|v_rec_#in~x_1|} OutVars{rec_~x=v_rec_~x_1, rec_#in~x=|v_rec_#in~x_1|} AuxVars[] AssignedVars[rec_~x] 8463#L10 [52] L10-->L12: Formula: (> v_rec_~x_3 0) InVars {rec_~x=v_rec_~x_3} OutVars{rec_~x=v_rec_~x_3} AuxVars[] AssignedVars[] 8472#L12 [60] L12-->L15: Formula: (let ((.cse0 (mod v_rec_~x_7 2)) (.cse1 (+ v_rec_~x_7 1))) (and (> 0 (+ .cse0 (- 2))) (= v_rec_~x_6 .cse1) (< 0 .cse0) (= |v_rec_#t~pre1_1| .cse1))) InVars {rec_~x=v_rec_~x_7} OutVars{rec_~x=v_rec_~x_6, rec_#t~pre1=|v_rec_#t~pre1_1|} AuxVars[] AssignedVars[rec_~x, rec_#t~pre1] 8459#L15 [2020-06-22 02:23:22,104 INFO L796 eck$LassoCheckResult]: Loop: 8459#L15 [38] L15-->recENTRY: Formula: (= |v_rec_#in~xInParam_2| |v_rec_#t~pre1_4|) InVars {rec_#t~pre1=|v_rec_#t~pre1_4|} OutVars{rec_#in~x=|v_rec_#in~xInParam_2|} AuxVars[] AssignedVars[rec_#in~x]< 8458#recENTRY [32] recENTRY-->L10: Formula: (= v_rec_~x_1 |v_rec_#in~x_1|) InVars {rec_#in~x=|v_rec_#in~x_1|} OutVars{rec_~x=v_rec_~x_1, rec_#in~x=|v_rec_#in~x_1|} AuxVars[] AssignedVars[rec_~x] 8460#L10 [52] L10-->L12: Formula: (> v_rec_~x_3 0) InVars {rec_~x=v_rec_~x_3} OutVars{rec_~x=v_rec_~x_3} AuxVars[] AssignedVars[] 8469#L12 [57] L12-->L13: Formula: (= (mod v_rec_~x_4 2) 0) InVars {rec_~x=v_rec_~x_4} OutVars{rec_~x=v_rec_~x_4} AuxVars[] AssignedVars[] 8467#L13 [33] L13-->recENTRY: Formula: (= |v_rec_#in~xInParam_1| (let ((.cse0 (div v_rec_~x_10 2))) (ite (and (not (= 0 (mod v_rec_~x_10 2))) (< v_rec_~x_10 0)) (+ .cse0 1) .cse0))) InVars {rec_~x=v_rec_~x_10} OutVars{rec_#in~x=|v_rec_#in~xInParam_1|} AuxVars[] AssignedVars[rec_#in~x]< 8468#recENTRY [32] recENTRY-->L10: Formula: (= v_rec_~x_1 |v_rec_#in~x_1|) InVars {rec_#in~x=|v_rec_#in~x_1|} OutVars{rec_~x=v_rec_~x_1, rec_#in~x=|v_rec_#in~x_1|} AuxVars[] AssignedVars[rec_~x] 8474#L10 [52] L10-->L12: Formula: (> v_rec_~x_3 0) InVars {rec_~x=v_rec_~x_3} OutVars{rec_~x=v_rec_~x_3} AuxVars[] AssignedVars[] 8473#L12 [59] L12-->L15: Formula: (let ((.cse0 (+ v_rec_~x_7 1))) (and (= v_rec_~x_6 .cse0) (< 0 (mod v_rec_~x_7 2)) (= |v_rec_#t~pre1_1| .cse0) (>= v_rec_~x_7 0))) InVars {rec_~x=v_rec_~x_7} OutVars{rec_~x=v_rec_~x_6, rec_#t~pre1=|v_rec_#t~pre1_1|} AuxVars[] AssignedVars[rec_~x, rec_#t~pre1] 8459#L15 [2020-06-22 02:23:22,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:22,104 INFO L82 PathProgramCache]: Analyzing trace with hash 67806949, now seen corresponding path program 3 times [2020-06-22 02:23:22,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:22,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:22,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:22,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:23:22,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:22,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:22,111 INFO L82 PathProgramCache]: Analyzing trace with hash -127452378, now seen corresponding path program 1 times [2020-06-22 02:23:22,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:22,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:22,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:22,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:23:22,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:22,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:22,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1084310006, now seen corresponding path program 1 times [2020-06-22 02:23:22,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:22,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:22,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:22,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:23:22,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:22,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 02:23:22 BasicIcfg [2020-06-22 02:23:22,463 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 02:23:22,463 INFO L168 Benchmark]: Toolchain (without parser) took 10663.20 ms. Allocated memory was 514.9 MB in the beginning and 690.0 MB in the end (delta: 175.1 MB). Free memory was 437.2 MB in the beginning and 510.2 MB in the end (delta: -73.0 MB). Peak memory consumption was 102.1 MB. Max. memory is 50.3 GB. [2020-06-22 02:23:22,465 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 514.9 MB. Free memory is still 456.9 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 02:23:22,466 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.10 ms. Allocated memory was 514.9 MB in the beginning and 582.0 MB in the end (delta: 67.1 MB). Free memory was 436.6 MB in the beginning and 552.6 MB in the end (delta: -115.9 MB). Peak memory consumption was 29.3 MB. Max. memory is 50.3 GB. [2020-06-22 02:23:22,466 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.53 ms. Allocated memory is still 582.0 MB. Free memory was 552.6 MB in the beginning and 551.1 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 50.3 GB. [2020-06-22 02:23:22,467 INFO L168 Benchmark]: Boogie Preprocessor took 16.67 ms. Allocated memory is still 582.0 MB. Free memory was 551.1 MB in the beginning and 550.2 MB in the end (delta: 828.6 kB). Peak memory consumption was 828.6 kB. Max. memory is 50.3 GB. [2020-06-22 02:23:22,467 INFO L168 Benchmark]: RCFGBuilder took 212.40 ms. Allocated memory is still 582.0 MB. Free memory was 550.2 MB in the beginning and 538.1 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. [2020-06-22 02:23:22,468 INFO L168 Benchmark]: BlockEncodingV2 took 94.12 ms. Allocated memory is still 582.0 MB. Free memory was 538.1 MB in the beginning and 531.7 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. [2020-06-22 02:23:22,468 INFO L168 Benchmark]: TraceAbstraction took 174.93 ms. Allocated memory is still 582.0 MB. Free memory was 531.7 MB in the beginning and 520.1 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 50.3 GB. [2020-06-22 02:23:22,469 INFO L168 Benchmark]: BuchiAutomizer took 9827.11 ms. Allocated memory was 582.0 MB in the beginning and 690.0 MB in the end (delta: 108.0 MB). Free memory was 520.1 MB in the beginning and 510.2 MB in the end (delta: 9.9 MB). Peak memory consumption was 117.9 MB. Max. memory is 50.3 GB. [2020-06-22 02:23:22,474 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 17 locations, 21 edges - StatisticsResult: Encoded RCFG 13 locations, 34 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 514.9 MB. Free memory is still 456.9 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 298.10 ms. Allocated memory was 514.9 MB in the beginning and 582.0 MB in the end (delta: 67.1 MB). Free memory was 436.6 MB in the beginning and 552.6 MB in the end (delta: -115.9 MB). Peak memory consumption was 29.3 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 34.53 ms. Allocated memory is still 582.0 MB. Free memory was 552.6 MB in the beginning and 551.1 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 16.67 ms. Allocated memory is still 582.0 MB. Free memory was 551.1 MB in the beginning and 550.2 MB in the end (delta: 828.6 kB). Peak memory consumption was 828.6 kB. Max. memory is 50.3 GB. * RCFGBuilder took 212.40 ms. Allocated memory is still 582.0 MB. Free memory was 550.2 MB in the beginning and 538.1 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 94.12 ms. Allocated memory is still 582.0 MB. Free memory was 538.1 MB in the beginning and 531.7 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. * TraceAbstraction took 174.93 ms. Allocated memory is still 582.0 MB. Free memory was 531.7 MB in the beginning and 520.1 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 9827.11 ms. Allocated memory was 582.0 MB in the beginning and 690.0 MB in the end (delta: 108.0 MB). Free memory was 520.1 MB in the beginning and 510.2 MB in the end (delta: 9.9 MB). Peak memory consumption was 117.9 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - AllSpecificationsHoldResult: All specifications hold We were not able to verify any specifiation because the program does not contain any specification. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 13 locations, 0 error locations. SAFE Result, 0.1s 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=13occurred 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, 5 LocationsWithAnnotation, 17 PreInvPairs, 17 NumberOfFragments, 5 HoareAnnotationTreeSize, 17 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 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 (4 trivial, 0 deterministic, 2 nondeterministic) and one nonterminating remainder module.One nondeterministic module has affine ranking function \old(x) and consists of 6 locations. One nondeterministic module has affine ranking function -1 * aux-++x-aux + 1 and consists of 19 locations. 4 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.7s and 6 iterations. TraceHistogramMax:3. Analysis of lassos took 7.2s. Construction of modules took 0.4s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 182 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 84 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 104 SDtfs, 114 SDslu, 194 SDs, 0 SdLazy, 383 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT1 conc1 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital22 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div369 bol100 ite100 ukn100 eq143 hnf52 smp85 dnf100 smp100 tf104 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 35ms VariablesStem: 0 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 4.7s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 15]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {x=2, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@4f79ae5d=0, \old(x)=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@287f306c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@17be7780=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@152b3e62=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6e2d62f=0, store=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2c12abe4=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3bc8d575=0, x=0, y=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 15]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L21] int x = __VERIFIER_nondet_int(); [L22] int y; [L23] CALL rec(x) [L10] COND FALSE !(x <= 0) [L12] COND FALSE !(x%2 == 0) [L15] ++x Loop: [L15] CALL rec(++x) [L10] COND FALSE !(x <= 0) [L12] COND TRUE x%2 == 0 [L13] CALL rec(x/2) [L10] COND FALSE !(x <= 0) [L12] COND FALSE !(x%2 == 0) [L15] ++x End of lasso representation. RESULT: Ultimate proved your program to be incorrect! !SESSION 2020-06-22 02:23:08.521 ----------------------------------------------- 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 02:23:22.710 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check