122.49/77.70 MAYBE 122.49/77.70 122.49/77.70 Ultimate: Cannot open display: 122.49/77.70 This is Ultimate 0.1.24-8dc7c08-m 122.49/77.70 [2019-03-28 12:35:12,012 INFO L170 SettingsManager]: Resetting all preferences to default values... 122.49/77.70 [2019-03-28 12:35:12,014 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 122.49/77.70 [2019-03-28 12:35:12,026 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 122.49/77.70 [2019-03-28 12:35:12,026 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 122.49/77.70 [2019-03-28 12:35:12,027 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 122.49/77.70 [2019-03-28 12:35:12,028 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 122.49/77.70 [2019-03-28 12:35:12,030 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 122.49/77.70 [2019-03-28 12:35:12,032 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 122.49/77.70 [2019-03-28 12:35:12,032 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 122.49/77.70 [2019-03-28 12:35:12,033 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 122.49/77.70 [2019-03-28 12:35:12,034 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 122.49/77.70 [2019-03-28 12:35:12,034 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 122.49/77.70 [2019-03-28 12:35:12,035 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 122.49/77.70 [2019-03-28 12:35:12,037 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 122.49/77.70 [2019-03-28 12:35:12,038 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 122.49/77.70 [2019-03-28 12:35:12,038 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 122.49/77.70 [2019-03-28 12:35:12,040 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 122.49/77.70 [2019-03-28 12:35:12,042 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 122.49/77.70 [2019-03-28 12:35:12,044 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 122.49/77.70 [2019-03-28 12:35:12,045 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 122.49/77.70 [2019-03-28 12:35:12,046 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 122.49/77.70 [2019-03-28 12:35:12,048 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 122.49/77.70 [2019-03-28 12:35:12,049 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 122.49/77.70 [2019-03-28 12:35:12,049 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 122.49/77.70 [2019-03-28 12:35:12,050 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 122.49/77.70 [2019-03-28 12:35:12,050 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 122.49/77.70 [2019-03-28 12:35:12,051 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 122.49/77.70 [2019-03-28 12:35:12,051 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 122.49/77.70 [2019-03-28 12:35:12,052 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 122.49/77.70 [2019-03-28 12:35:12,053 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 122.49/77.70 [2019-03-28 12:35:12,053 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 122.49/77.70 [2019-03-28 12:35:12,054 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 122.49/77.70 [2019-03-28 12:35:12,055 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 122.49/77.70 [2019-03-28 12:35:12,055 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 122.49/77.70 [2019-03-28 12:35:12,055 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 122.49/77.70 [2019-03-28 12:35:12,056 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 122.49/77.70 [2019-03-28 12:35:12,057 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 122.49/77.70 [2019-03-28 12:35:12,057 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 122.49/77.70 [2019-03-28 12:35:12,058 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 122.49/77.70 [2019-03-28 12:35:12,072 INFO L110 SettingsManager]: Loading preferences was successful 122.49/77.70 [2019-03-28 12:35:12,073 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 122.49/77.70 [2019-03-28 12:35:12,074 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 122.49/77.70 [2019-03-28 12:35:12,074 INFO L133 SettingsManager]: * Rewrite not-equals=true 122.49/77.70 [2019-03-28 12:35:12,074 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 122.49/77.70 [2019-03-28 12:35:12,074 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 122.49/77.70 [2019-03-28 12:35:12,075 INFO L133 SettingsManager]: * Use SBE=true 122.49/77.70 [2019-03-28 12:35:12,075 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 122.49/77.70 [2019-03-28 12:35:12,075 INFO L133 SettingsManager]: * Use old map elimination=false 122.49/77.70 [2019-03-28 12:35:12,075 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 122.49/77.70 [2019-03-28 12:35:12,075 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 122.49/77.70 [2019-03-28 12:35:12,075 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 122.49/77.70 [2019-03-28 12:35:12,076 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 122.49/77.70 [2019-03-28 12:35:12,076 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 122.49/77.70 [2019-03-28 12:35:12,076 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 122.49/77.70 [2019-03-28 12:35:12,076 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 122.49/77.70 [2019-03-28 12:35:12,076 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 122.49/77.70 [2019-03-28 12:35:12,076 INFO L133 SettingsManager]: * Check division by zero=IGNORE 122.49/77.70 [2019-03-28 12:35:12,077 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 122.49/77.70 [2019-03-28 12:35:12,077 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 122.49/77.70 [2019-03-28 12:35:12,077 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 122.49/77.70 [2019-03-28 12:35:12,077 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 122.49/77.70 [2019-03-28 12:35:12,077 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 122.49/77.70 [2019-03-28 12:35:12,078 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 122.49/77.70 [2019-03-28 12:35:12,078 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 122.49/77.70 [2019-03-28 12:35:12,078 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 122.49/77.70 [2019-03-28 12:35:12,078 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 122.49/77.70 [2019-03-28 12:35:12,078 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 122.49/77.70 [2019-03-28 12:35:12,078 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 122.49/77.70 [2019-03-28 12:35:12,106 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 122.49/77.70 [2019-03-28 12:35:12,119 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 122.49/77.70 [2019-03-28 12:35:12,122 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 122.49/77.70 [2019-03-28 12:35:12,125 INFO L271 PluginConnector]: Initializing CDTParser... 122.49/77.70 [2019-03-28 12:35:12,125 INFO L276 PluginConnector]: CDTParser initialized 122.49/77.70 [2019-03-28 12:35:12,126 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 122.49/77.70 [2019-03-28 12:35:12,228 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/e3702004020e40968dc2f1039421997c/FLAG23ffd1d9d 122.49/77.70 [2019-03-28 12:35:12,582 INFO L307 CDTParser]: Found 1 translation units. 122.49/77.70 [2019-03-28 12:35:12,583 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 122.49/77.70 [2019-03-28 12:35:12,583 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 122.49/77.70 [2019-03-28 12:35:12,590 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/e3702004020e40968dc2f1039421997c/FLAG23ffd1d9d 122.49/77.70 [2019-03-28 12:35:13,023 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/e3702004020e40968dc2f1039421997c 122.49/77.70 [2019-03-28 12:35:13,034 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 122.49/77.70 [2019-03-28 12:35:13,036 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 122.49/77.70 [2019-03-28 12:35:13,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 122.49/77.70 [2019-03-28 12:35:13,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 122.49/77.70 [2019-03-28 12:35:13,042 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 122.49/77.70 [2019-03-28 12:35:13,043 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:35:13" (1/1) ... 122.49/77.70 [2019-03-28 12:35:13,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e1ad19a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:13, skipping insertion in model container 122.49/77.70 [2019-03-28 12:35:13,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:35:13" (1/1) ... 122.49/77.70 [2019-03-28 12:35:13,054 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 122.49/77.70 [2019-03-28 12:35:13,072 INFO L176 MainTranslator]: Built tables and reachable declarations 122.49/77.70 [2019-03-28 12:35:13,243 INFO L206 PostProcessor]: Analyzing one entry point: main 122.49/77.70 [2019-03-28 12:35:13,255 INFO L191 MainTranslator]: Completed pre-run 122.49/77.70 [2019-03-28 12:35:13,276 INFO L206 PostProcessor]: Analyzing one entry point: main 122.49/77.70 [2019-03-28 12:35:13,355 INFO L195 MainTranslator]: Completed translation 122.49/77.70 [2019-03-28 12:35:13,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:13 WrapperNode 122.49/77.70 [2019-03-28 12:35:13,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 122.49/77.70 [2019-03-28 12:35:13,357 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 122.49/77.70 [2019-03-28 12:35:13,357 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 122.49/77.70 [2019-03-28 12:35:13,357 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 122.49/77.70 [2019-03-28 12:35:13,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:13" (1/1) ... 122.49/77.70 [2019-03-28 12:35:13,377 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:13" (1/1) ... 122.49/77.70 [2019-03-28 12:35:13,402 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 122.49/77.70 [2019-03-28 12:35:13,402 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 122.49/77.70 [2019-03-28 12:35:13,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 122.49/77.70 [2019-03-28 12:35:13,403 INFO L276 PluginConnector]: Boogie Preprocessor initialized 122.49/77.70 [2019-03-28 12:35:13,413 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:13" (1/1) ... 122.49/77.70 [2019-03-28 12:35:13,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:13" (1/1) ... 122.49/77.70 [2019-03-28 12:35:13,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:13" (1/1) ... 122.49/77.70 [2019-03-28 12:35:13,416 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:13" (1/1) ... 122.49/77.70 [2019-03-28 12:35:13,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:13" (1/1) ... 122.49/77.70 [2019-03-28 12:35:13,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:13" (1/1) ... 122.49/77.70 [2019-03-28 12:35:13,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:13" (1/1) ... 122.49/77.70 [2019-03-28 12:35:13,431 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 122.49/77.70 [2019-03-28 12:35:13,432 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 122.49/77.70 [2019-03-28 12:35:13,432 INFO L271 PluginConnector]: Initializing RCFGBuilder... 122.49/77.70 [2019-03-28 12:35:13,432 INFO L276 PluginConnector]: RCFGBuilder initialized 122.49/77.70 [2019-03-28 12:35:13,433 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:13" (1/1) ... 122.49/77.70 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 122.49/77.70 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 122.49/77.70 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 122.49/77.70 [2019-03-28 12:35:13,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 122.49/77.70 [2019-03-28 12:35:13,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 122.49/77.70 [2019-03-28 12:35:13,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 122.49/77.70 [2019-03-28 12:35:13,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 122.49/77.70 [2019-03-28 12:35:13,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 122.49/77.70 [2019-03-28 12:35:13,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 122.49/77.70 [2019-03-28 12:35:13,770 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 122.49/77.70 [2019-03-28 12:35:13,770 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. 122.49/77.70 [2019-03-28 12:35:13,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:35:13 BoogieIcfgContainer 122.49/77.70 [2019-03-28 12:35:13,772 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 122.49/77.70 [2019-03-28 12:35:13,772 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 122.49/77.70 [2019-03-28 12:35:13,772 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 122.49/77.70 [2019-03-28 12:35:13,775 INFO L276 PluginConnector]: BlockEncodingV2 initialized 122.49/77.70 [2019-03-28 12:35:13,775 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:35:13" (1/1) ... 122.49/77.70 [2019-03-28 12:35:13,792 INFO L313 BlockEncoder]: Initial Icfg 30 locations, 36 edges 122.49/77.70 [2019-03-28 12:35:13,794 INFO L258 BlockEncoder]: Using Remove infeasible edges 122.49/77.70 [2019-03-28 12:35:13,795 INFO L263 BlockEncoder]: Using Maximize final states 122.49/77.70 [2019-03-28 12:35:13,795 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 122.49/77.70 [2019-03-28 12:35:13,795 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 122.49/77.70 [2019-03-28 12:35:13,797 INFO L296 BlockEncoder]: Using Remove sink states 122.49/77.70 [2019-03-28 12:35:13,798 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 122.49/77.70 [2019-03-28 12:35:13,798 INFO L179 BlockEncoder]: Using Rewrite not-equals 122.49/77.70 [2019-03-28 12:35:13,826 INFO L185 BlockEncoder]: Using Use SBE 122.49/77.70 [2019-03-28 12:35:13,857 INFO L200 BlockEncoder]: SBE split 14 edges 122.49/77.70 [2019-03-28 12:35:13,862 INFO L70 emoveInfeasibleEdges]: Removed 3 edges and 0 locations because of local infeasibility 122.49/77.70 [2019-03-28 12:35:13,864 INFO L71 MaximizeFinalStates]: 0 new accepting states 122.49/77.70 [2019-03-28 12:35:13,887 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding 122.49/77.70 [2019-03-28 12:35:13,890 INFO L70 RemoveSinkStates]: Removed 7 edges and 3 locations by removing sink states 122.49/77.70 [2019-03-28 12:35:13,891 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 122.49/77.70 [2019-03-28 12:35:13,892 INFO L71 MaximizeFinalStates]: 0 new accepting states 122.49/77.70 [2019-03-28 12:35:13,892 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 122.49/77.70 [2019-03-28 12:35:13,892 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 122.49/77.70 [2019-03-28 12:35:13,893 INFO L313 BlockEncoder]: Encoded RCFG 22 locations, 39 edges 122.49/77.70 [2019-03-28 12:35:13,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:35:13 BasicIcfg 122.49/77.70 [2019-03-28 12:35:13,894 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 122.49/77.70 [2019-03-28 12:35:13,895 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 122.49/77.70 [2019-03-28 12:35:13,895 INFO L271 PluginConnector]: Initializing TraceAbstraction... 122.49/77.70 [2019-03-28 12:35:13,898 INFO L276 PluginConnector]: TraceAbstraction initialized 122.49/77.70 [2019-03-28 12:35:13,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:35:13" (1/4) ... 122.49/77.70 [2019-03-28 12:35:13,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25f2cca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:35:13, skipping insertion in model container 122.49/77.70 [2019-03-28 12:35:13,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:13" (2/4) ... 122.49/77.70 [2019-03-28 12:35:13,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25f2cca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:35:13, skipping insertion in model container 122.49/77.70 [2019-03-28 12:35:13,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:35:13" (3/4) ... 122.49/77.70 [2019-03-28 12:35:13,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25f2cca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:35:13, skipping insertion in model container 122.49/77.70 [2019-03-28 12:35:13,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:35:13" (4/4) ... 122.49/77.70 [2019-03-28 12:35:13,902 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 122.49/77.70 [2019-03-28 12:35:13,912 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 122.49/77.70 [2019-03-28 12:35:13,920 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. 122.49/77.70 [2019-03-28 12:35:13,937 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. 122.49/77.70 [2019-03-28 12:35:13,966 INFO L133 ementStrategyFactory]: Using default assertion order modulation 122.49/77.70 [2019-03-28 12:35:13,967 INFO L382 AbstractCegarLoop]: Interprodecural is true 122.49/77.70 [2019-03-28 12:35:13,967 INFO L383 AbstractCegarLoop]: Hoare is true 122.49/77.70 [2019-03-28 12:35:13,967 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 122.49/77.70 [2019-03-28 12:35:13,968 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 122.49/77.70 [2019-03-28 12:35:13,968 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 122.49/77.70 [2019-03-28 12:35:13,968 INFO L387 AbstractCegarLoop]: Difference is false 122.49/77.70 [2019-03-28 12:35:13,968 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 122.49/77.70 [2019-03-28 12:35:13,968 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 122.49/77.70 [2019-03-28 12:35:13,983 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. 122.49/77.70 [2019-03-28 12:35:13,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 122.49/77.70 [2019-03-28 12:35:13,989 INFO L394 BasicCegarLoop]: Found error trace 122.49/77.70 [2019-03-28 12:35:13,990 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 122.49/77.70 [2019-03-28 12:35:13,993 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 122.49/77.70 [2019-03-28 12:35:13,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.49/77.70 [2019-03-28 12:35:13,998 INFO L82 PathProgramCache]: Analyzing trace with hash 169792299, now seen corresponding path program 1 times 122.49/77.70 [2019-03-28 12:35:14,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.49/77.70 [2019-03-28 12:35:14,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.49/77.70 [2019-03-28 12:35:14,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:14,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:14,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.70 [2019-03-28 12:35:14,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 122.49/77.70 [2019-03-28 12:35:14,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 122.49/77.70 [2019-03-28 12:35:14,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 122.49/77.70 [2019-03-28 12:35:14,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 122.49/77.70 [2019-03-28 12:35:14,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 122.49/77.70 [2019-03-28 12:35:14,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 122.49/77.70 [2019-03-28 12:35:14,205 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. 122.49/77.70 [2019-03-28 12:35:14,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 122.49/77.70 [2019-03-28 12:35:14,310 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. 122.49/77.70 [2019-03-28 12:35:14,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 122.49/77.70 [2019-03-28 12:35:14,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 122.49/77.70 [2019-03-28 12:35:14,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 122.49/77.70 [2019-03-28 12:35:14,326 INFO L225 Difference]: With dead ends: 22 122.49/77.70 [2019-03-28 12:35:14,326 INFO L226 Difference]: Without dead ends: 21 122.49/77.70 [2019-03-28 12:35:14,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 122.49/77.70 [2019-03-28 12:35:14,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. 122.49/77.70 [2019-03-28 12:35:14,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. 122.49/77.70 [2019-03-28 12:35:14,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 122.49/77.70 [2019-03-28 12:35:14,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 37 transitions. 122.49/77.70 [2019-03-28 12:35:14,369 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 37 transitions. Word has length 5 122.49/77.70 [2019-03-28 12:35:14,370 INFO L84 Accepts]: Finished accepts. word is rejected. 122.49/77.70 [2019-03-28 12:35:14,370 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 37 transitions. 122.49/77.70 [2019-03-28 12:35:14,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 122.49/77.70 [2019-03-28 12:35:14,371 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 37 transitions. 122.49/77.70 [2019-03-28 12:35:14,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 122.49/77.70 [2019-03-28 12:35:14,371 INFO L394 BasicCegarLoop]: Found error trace 122.49/77.70 [2019-03-28 12:35:14,371 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 122.49/77.70 [2019-03-28 12:35:14,372 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 122.49/77.70 [2019-03-28 12:35:14,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.49/77.70 [2019-03-28 12:35:14,372 INFO L82 PathProgramCache]: Analyzing trace with hash 169792301, now seen corresponding path program 1 times 122.49/77.70 [2019-03-28 12:35:14,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.49/77.70 [2019-03-28 12:35:14,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.49/77.70 [2019-03-28 12:35:14,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:14,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:14,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.70 [2019-03-28 12:35:14,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 122.49/77.70 [2019-03-28 12:35:14,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 122.49/77.70 [2019-03-28 12:35:14,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 122.49/77.70 [2019-03-28 12:35:14,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 122.49/77.70 [2019-03-28 12:35:14,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 122.49/77.70 [2019-03-28 12:35:14,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 122.49/77.70 [2019-03-28 12:35:14,421 INFO L87 Difference]: Start difference. First operand 21 states and 37 transitions. Second operand 3 states. 122.49/77.70 [2019-03-28 12:35:14,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 122.49/77.70 [2019-03-28 12:35:14,500 INFO L93 Difference]: Finished difference Result 22 states and 37 transitions. 122.49/77.70 [2019-03-28 12:35:14,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 122.49/77.70 [2019-03-28 12:35:14,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 122.49/77.70 [2019-03-28 12:35:14,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 122.49/77.70 [2019-03-28 12:35:14,502 INFO L225 Difference]: With dead ends: 22 122.49/77.70 [2019-03-28 12:35:14,502 INFO L226 Difference]: Without dead ends: 21 122.49/77.70 [2019-03-28 12:35:14,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 122.49/77.70 [2019-03-28 12:35:14,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. 122.49/77.70 [2019-03-28 12:35:14,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. 122.49/77.70 [2019-03-28 12:35:14,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 122.49/77.70 [2019-03-28 12:35:14,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 36 transitions. 122.49/77.70 [2019-03-28 12:35:14,508 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 36 transitions. Word has length 5 122.49/77.70 [2019-03-28 12:35:14,508 INFO L84 Accepts]: Finished accepts. word is rejected. 122.49/77.70 [2019-03-28 12:35:14,508 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 36 transitions. 122.49/77.70 [2019-03-28 12:35:14,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 122.49/77.70 [2019-03-28 12:35:14,508 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 36 transitions. 122.49/77.70 [2019-03-28 12:35:14,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 122.49/77.70 [2019-03-28 12:35:14,509 INFO L394 BasicCegarLoop]: Found error trace 122.49/77.70 [2019-03-28 12:35:14,509 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 122.49/77.70 [2019-03-28 12:35:14,509 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 122.49/77.70 [2019-03-28 12:35:14,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.49/77.70 [2019-03-28 12:35:14,510 INFO L82 PathProgramCache]: Analyzing trace with hash 169792302, now seen corresponding path program 1 times 122.49/77.70 [2019-03-28 12:35:14,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.49/77.70 [2019-03-28 12:35:14,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.49/77.70 [2019-03-28 12:35:14,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:14,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:14,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.70 [2019-03-28 12:35:14,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 122.49/77.70 [2019-03-28 12:35:14,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 122.49/77.70 [2019-03-28 12:35:14,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 122.49/77.70 [2019-03-28 12:35:14,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 122.49/77.70 [2019-03-28 12:35:14,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 122.49/77.70 [2019-03-28 12:35:14,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 122.49/77.70 [2019-03-28 12:35:14,546 INFO L87 Difference]: Start difference. First operand 21 states and 36 transitions. Second operand 4 states. 122.49/77.70 [2019-03-28 12:35:14,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 122.49/77.70 [2019-03-28 12:35:14,603 INFO L93 Difference]: Finished difference Result 21 states and 36 transitions. 122.49/77.70 [2019-03-28 12:35:14,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 122.49/77.70 [2019-03-28 12:35:14,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 122.49/77.70 [2019-03-28 12:35:14,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 122.49/77.70 [2019-03-28 12:35:14,605 INFO L225 Difference]: With dead ends: 21 122.49/77.70 [2019-03-28 12:35:14,605 INFO L226 Difference]: Without dead ends: 20 122.49/77.70 [2019-03-28 12:35:14,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 122.49/77.70 [2019-03-28 12:35:14,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. 122.49/77.70 [2019-03-28 12:35:14,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. 122.49/77.70 [2019-03-28 12:35:14,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 122.49/77.70 [2019-03-28 12:35:14,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 35 transitions. 122.49/77.70 [2019-03-28 12:35:14,610 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 35 transitions. Word has length 5 122.49/77.70 [2019-03-28 12:35:14,610 INFO L84 Accepts]: Finished accepts. word is rejected. 122.49/77.70 [2019-03-28 12:35:14,610 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 35 transitions. 122.49/77.70 [2019-03-28 12:35:14,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 122.49/77.70 [2019-03-28 12:35:14,610 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 35 transitions. 122.49/77.70 [2019-03-28 12:35:14,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 122.49/77.70 [2019-03-28 12:35:14,611 INFO L394 BasicCegarLoop]: Found error trace 122.49/77.70 [2019-03-28 12:35:14,611 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 122.49/77.70 [2019-03-28 12:35:14,611 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 122.49/77.70 [2019-03-28 12:35:14,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.49/77.70 [2019-03-28 12:35:14,612 INFO L82 PathProgramCache]: Analyzing trace with hash 968593264, now seen corresponding path program 1 times 122.49/77.70 [2019-03-28 12:35:14,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.49/77.70 [2019-03-28 12:35:14,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.49/77.70 [2019-03-28 12:35:14,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:14,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:14,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.70 [2019-03-28 12:35:14,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 122.49/77.70 [2019-03-28 12:35:14,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 122.49/77.70 [2019-03-28 12:35:14,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 122.49/77.70 [2019-03-28 12:35:14,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 122.49/77.70 [2019-03-28 12:35:14,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 122.49/77.70 [2019-03-28 12:35:14,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 122.49/77.70 [2019-03-28 12:35:14,661 INFO L87 Difference]: Start difference. First operand 20 states and 35 transitions. Second operand 3 states. 122.49/77.70 [2019-03-28 12:35:14,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 122.49/77.70 [2019-03-28 12:35:14,713 INFO L93 Difference]: Finished difference Result 21 states and 35 transitions. 122.49/77.70 [2019-03-28 12:35:14,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 122.49/77.70 [2019-03-28 12:35:14,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 122.49/77.70 [2019-03-28 12:35:14,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 122.49/77.70 [2019-03-28 12:35:14,715 INFO L225 Difference]: With dead ends: 21 122.49/77.70 [2019-03-28 12:35:14,715 INFO L226 Difference]: Without dead ends: 20 122.49/77.70 [2019-03-28 12:35:14,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 122.49/77.70 [2019-03-28 12:35:14,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. 122.49/77.70 [2019-03-28 12:35:14,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. 122.49/77.70 [2019-03-28 12:35:14,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 122.49/77.70 [2019-03-28 12:35:14,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. 122.49/77.70 [2019-03-28 12:35:14,719 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 34 transitions. Word has length 6 122.49/77.70 [2019-03-28 12:35:14,720 INFO L84 Accepts]: Finished accepts. word is rejected. 122.49/77.70 [2019-03-28 12:35:14,720 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 34 transitions. 122.49/77.70 [2019-03-28 12:35:14,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 122.49/77.70 [2019-03-28 12:35:14,720 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 34 transitions. 122.49/77.70 [2019-03-28 12:35:14,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 122.49/77.70 [2019-03-28 12:35:14,721 INFO L394 BasicCegarLoop]: Found error trace 122.49/77.70 [2019-03-28 12:35:14,721 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 122.49/77.70 [2019-03-28 12:35:14,721 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 122.49/77.70 [2019-03-28 12:35:14,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.49/77.70 [2019-03-28 12:35:14,722 INFO L82 PathProgramCache]: Analyzing trace with hash 968593265, now seen corresponding path program 1 times 122.49/77.70 [2019-03-28 12:35:14,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.49/77.70 [2019-03-28 12:35:14,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.49/77.70 [2019-03-28 12:35:14,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:14,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:14,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.70 [2019-03-28 12:35:14,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 122.49/77.70 [2019-03-28 12:35:14,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 122.49/77.70 [2019-03-28 12:35:14,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 122.49/77.70 [2019-03-28 12:35:14,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 122.49/77.70 [2019-03-28 12:35:14,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 122.49/77.70 [2019-03-28 12:35:14,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 122.49/77.70 [2019-03-28 12:35:14,763 INFO L87 Difference]: Start difference. First operand 20 states and 34 transitions. Second operand 4 states. 122.49/77.70 [2019-03-28 12:35:14,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 122.49/77.70 [2019-03-28 12:35:14,809 INFO L93 Difference]: Finished difference Result 20 states and 34 transitions. 122.49/77.70 [2019-03-28 12:35:14,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 122.49/77.70 [2019-03-28 12:35:14,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 122.49/77.70 [2019-03-28 12:35:14,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 122.49/77.70 [2019-03-28 12:35:14,810 INFO L225 Difference]: With dead ends: 20 122.49/77.70 [2019-03-28 12:35:14,810 INFO L226 Difference]: Without dead ends: 19 122.49/77.70 [2019-03-28 12:35:14,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 122.49/77.70 [2019-03-28 12:35:14,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. 122.49/77.70 [2019-03-28 12:35:14,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. 122.49/77.70 [2019-03-28 12:35:14,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 122.49/77.70 [2019-03-28 12:35:14,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. 122.49/77.70 [2019-03-28 12:35:14,814 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 33 transitions. Word has length 6 122.49/77.70 [2019-03-28 12:35:14,815 INFO L84 Accepts]: Finished accepts. word is rejected. 122.49/77.70 [2019-03-28 12:35:14,815 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 33 transitions. 122.49/77.70 [2019-03-28 12:35:14,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 122.49/77.70 [2019-03-28 12:35:14,815 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 33 transitions. 122.49/77.70 [2019-03-28 12:35:14,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 122.49/77.70 [2019-03-28 12:35:14,815 INFO L394 BasicCegarLoop]: Found error trace 122.49/77.70 [2019-03-28 12:35:14,816 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 122.49/77.70 [2019-03-28 12:35:14,816 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 122.49/77.70 [2019-03-28 12:35:14,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.49/77.70 [2019-03-28 12:35:14,816 INFO L82 PathProgramCache]: Analyzing trace with hash 968593262, now seen corresponding path program 1 times 122.49/77.70 [2019-03-28 12:35:14,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.49/77.70 [2019-03-28 12:35:14,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.49/77.70 [2019-03-28 12:35:14,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:14,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:14,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.70 [2019-03-28 12:35:14,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 122.49/77.70 [2019-03-28 12:35:14,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 122.49/77.70 [2019-03-28 12:35:14,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 122.49/77.70 [2019-03-28 12:35:14,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 122.49/77.70 [2019-03-28 12:35:14,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 122.49/77.70 [2019-03-28 12:35:14,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 122.49/77.70 [2019-03-28 12:35:14,847 INFO L87 Difference]: Start difference. First operand 19 states and 33 transitions. Second operand 3 states. 122.49/77.70 [2019-03-28 12:35:14,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 122.49/77.70 [2019-03-28 12:35:14,892 INFO L93 Difference]: Finished difference Result 19 states and 33 transitions. 122.49/77.70 [2019-03-28 12:35:14,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 122.49/77.70 [2019-03-28 12:35:14,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 122.49/77.70 [2019-03-28 12:35:14,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 122.49/77.70 [2019-03-28 12:35:14,893 INFO L225 Difference]: With dead ends: 19 122.49/77.70 [2019-03-28 12:35:14,893 INFO L226 Difference]: Without dead ends: 18 122.49/77.70 [2019-03-28 12:35:14,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 122.49/77.70 [2019-03-28 12:35:14,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. 122.49/77.70 [2019-03-28 12:35:14,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. 122.49/77.70 [2019-03-28 12:35:14,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 122.49/77.70 [2019-03-28 12:35:14,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 31 transitions. 122.49/77.70 [2019-03-28 12:35:14,897 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 31 transitions. Word has length 6 122.49/77.70 [2019-03-28 12:35:14,897 INFO L84 Accepts]: Finished accepts. word is rejected. 122.49/77.70 [2019-03-28 12:35:14,897 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 31 transitions. 122.49/77.70 [2019-03-28 12:35:14,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 122.49/77.70 [2019-03-28 12:35:14,898 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 31 transitions. 122.49/77.70 [2019-03-28 12:35:14,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 122.49/77.70 [2019-03-28 12:35:14,898 INFO L394 BasicCegarLoop]: Found error trace 122.49/77.70 [2019-03-28 12:35:14,898 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 122.49/77.70 [2019-03-28 12:35:14,898 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 122.49/77.70 [2019-03-28 12:35:14,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.49/77.70 [2019-03-28 12:35:14,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1189752123, now seen corresponding path program 1 times 122.49/77.70 [2019-03-28 12:35:14,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.49/77.70 [2019-03-28 12:35:14,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.49/77.70 [2019-03-28 12:35:14,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:14,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:14,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:14,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.70 [2019-03-28 12:35:14,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 122.49/77.70 [2019-03-28 12:35:14,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 122.49/77.70 [2019-03-28 12:35:14,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 122.49/77.70 [2019-03-28 12:35:14,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 122.49/77.70 [2019-03-28 12:35:14,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 122.49/77.70 [2019-03-28 12:35:14,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 122.49/77.70 [2019-03-28 12:35:14,953 INFO L87 Difference]: Start difference. First operand 18 states and 31 transitions. Second operand 5 states. 122.49/77.70 [2019-03-28 12:35:15,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 122.49/77.70 [2019-03-28 12:35:15,056 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. 122.49/77.70 [2019-03-28 12:35:15,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 122.49/77.70 [2019-03-28 12:35:15,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 122.49/77.70 [2019-03-28 12:35:15,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 122.49/77.70 [2019-03-28 12:35:15,057 INFO L225 Difference]: With dead ends: 18 122.49/77.70 [2019-03-28 12:35:15,058 INFO L226 Difference]: Without dead ends: 17 122.49/77.70 [2019-03-28 12:35:15,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 122.49/77.70 [2019-03-28 12:35:15,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. 122.49/77.70 [2019-03-28 12:35:15,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. 122.49/77.70 [2019-03-28 12:35:15,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 122.49/77.70 [2019-03-28 12:35:15,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. 122.49/77.70 [2019-03-28 12:35:15,062 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 29 transitions. Word has length 8 122.49/77.70 [2019-03-28 12:35:15,062 INFO L84 Accepts]: Finished accepts. word is rejected. 122.49/77.70 [2019-03-28 12:35:15,062 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 29 transitions. 122.49/77.70 [2019-03-28 12:35:15,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 122.49/77.70 [2019-03-28 12:35:15,063 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 29 transitions. 122.49/77.70 [2019-03-28 12:35:15,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 122.49/77.70 [2019-03-28 12:35:15,063 INFO L394 BasicCegarLoop]: Found error trace 122.49/77.70 [2019-03-28 12:35:15,063 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 122.49/77.70 [2019-03-28 12:35:15,064 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 122.49/77.70 [2019-03-28 12:35:15,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.49/77.70 [2019-03-28 12:35:15,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1189752121, now seen corresponding path program 1 times 122.49/77.70 [2019-03-28 12:35:15,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.49/77.70 [2019-03-28 12:35:15,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.49/77.70 [2019-03-28 12:35:15,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:15,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:15,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.70 [2019-03-28 12:35:15,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 122.49/77.70 [2019-03-28 12:35:15,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 122.49/77.70 [2019-03-28 12:35:15,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 122.49/77.70 [2019-03-28 12:35:15,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 122.49/77.70 [2019-03-28 12:35:15,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 122.49/77.70 [2019-03-28 12:35:15,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 122.49/77.70 [2019-03-28 12:35:15,115 INFO L87 Difference]: Start difference. First operand 17 states and 29 transitions. Second operand 5 states. 122.49/77.70 [2019-03-28 12:35:15,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 122.49/77.70 [2019-03-28 12:35:15,210 INFO L93 Difference]: Finished difference Result 21 states and 33 transitions. 122.49/77.70 [2019-03-28 12:35:15,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 122.49/77.70 [2019-03-28 12:35:15,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 122.49/77.70 [2019-03-28 12:35:15,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 122.49/77.70 [2019-03-28 12:35:15,212 INFO L225 Difference]: With dead ends: 21 122.49/77.70 [2019-03-28 12:35:15,213 INFO L226 Difference]: Without dead ends: 20 122.49/77.70 [2019-03-28 12:35:15,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 122.49/77.70 [2019-03-28 12:35:15,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. 122.49/77.70 [2019-03-28 12:35:15,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. 122.49/77.70 [2019-03-28 12:35:15,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 122.49/77.70 [2019-03-28 12:35:15,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 32 transitions. 122.49/77.70 [2019-03-28 12:35:15,218 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 32 transitions. Word has length 8 122.49/77.70 [2019-03-28 12:35:15,218 INFO L84 Accepts]: Finished accepts. word is rejected. 122.49/77.70 [2019-03-28 12:35:15,218 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 32 transitions. 122.49/77.70 [2019-03-28 12:35:15,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 122.49/77.70 [2019-03-28 12:35:15,219 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 32 transitions. 122.49/77.70 [2019-03-28 12:35:15,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 122.49/77.70 [2019-03-28 12:35:15,219 INFO L394 BasicCegarLoop]: Found error trace 122.49/77.70 [2019-03-28 12:35:15,219 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 122.49/77.70 [2019-03-28 12:35:15,219 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 122.49/77.70 [2019-03-28 12:35:15,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.49/77.70 [2019-03-28 12:35:15,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1189752120, now seen corresponding path program 1 times 122.49/77.70 [2019-03-28 12:35:15,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.49/77.70 [2019-03-28 12:35:15,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.49/77.70 [2019-03-28 12:35:15,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:15,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:15,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.70 [2019-03-28 12:35:15,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 122.49/77.70 [2019-03-28 12:35:15,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 122.49/77.70 [2019-03-28 12:35:15,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 122.49/77.70 [2019-03-28 12:35:15,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 122.49/77.70 [2019-03-28 12:35:15,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 122.49/77.70 [2019-03-28 12:35:15,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 122.49/77.70 [2019-03-28 12:35:15,304 INFO L87 Difference]: Start difference. First operand 19 states and 32 transitions. Second operand 7 states. 122.49/77.70 [2019-03-28 12:35:15,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 122.49/77.70 [2019-03-28 12:35:15,410 INFO L93 Difference]: Finished difference Result 20 states and 32 transitions. 122.49/77.70 [2019-03-28 12:35:15,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 122.49/77.70 [2019-03-28 12:35:15,411 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 122.49/77.70 [2019-03-28 12:35:15,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 122.49/77.70 [2019-03-28 12:35:15,411 INFO L225 Difference]: With dead ends: 20 122.49/77.70 [2019-03-28 12:35:15,412 INFO L226 Difference]: Without dead ends: 19 122.49/77.70 [2019-03-28 12:35:15,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 122.49/77.70 [2019-03-28 12:35:15,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. 122.49/77.70 [2019-03-28 12:35:15,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. 122.49/77.70 [2019-03-28 12:35:15,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 122.49/77.70 [2019-03-28 12:35:15,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. 122.49/77.70 [2019-03-28 12:35:15,416 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 31 transitions. Word has length 8 122.49/77.70 [2019-03-28 12:35:15,416 INFO L84 Accepts]: Finished accepts. word is rejected. 122.49/77.70 [2019-03-28 12:35:15,416 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 31 transitions. 122.49/77.70 [2019-03-28 12:35:15,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 122.49/77.70 [2019-03-28 12:35:15,417 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. 122.49/77.70 [2019-03-28 12:35:15,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 122.49/77.70 [2019-03-28 12:35:15,417 INFO L394 BasicCegarLoop]: Found error trace 122.49/77.70 [2019-03-28 12:35:15,417 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 122.49/77.70 [2019-03-28 12:35:15,418 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 122.49/77.70 [2019-03-28 12:35:15,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.49/77.70 [2019-03-28 12:35:15,418 INFO L82 PathProgramCache]: Analyzing trace with hash -890467848, now seen corresponding path program 1 times 122.49/77.70 [2019-03-28 12:35:15,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.49/77.70 [2019-03-28 12:35:15,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.49/77.70 [2019-03-28 12:35:15,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:15,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:15,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.70 [2019-03-28 12:35:15,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 122.49/77.70 [2019-03-28 12:35:15,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 122.49/77.70 [2019-03-28 12:35:15,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 122.49/77.70 [2019-03-28 12:35:15,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 122.49/77.70 [2019-03-28 12:35:15,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 122.49/77.70 [2019-03-28 12:35:15,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 122.49/77.70 [2019-03-28 12:35:15,458 INFO L87 Difference]: Start difference. First operand 19 states and 31 transitions. Second operand 5 states. 122.49/77.70 [2019-03-28 12:35:15,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 122.49/77.70 [2019-03-28 12:35:15,531 INFO L93 Difference]: Finished difference Result 19 states and 31 transitions. 122.49/77.70 [2019-03-28 12:35:15,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 122.49/77.70 [2019-03-28 12:35:15,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 122.49/77.70 [2019-03-28 12:35:15,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 122.49/77.70 [2019-03-28 12:35:15,532 INFO L225 Difference]: With dead ends: 19 122.49/77.70 [2019-03-28 12:35:15,532 INFO L226 Difference]: Without dead ends: 18 122.49/77.70 [2019-03-28 12:35:15,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 122.49/77.70 [2019-03-28 12:35:15,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. 122.49/77.70 [2019-03-28 12:35:15,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. 122.49/77.70 [2019-03-28 12:35:15,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 122.49/77.70 [2019-03-28 12:35:15,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 29 transitions. 122.49/77.70 [2019-03-28 12:35:15,536 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 29 transitions. Word has length 10 122.49/77.70 [2019-03-28 12:35:15,537 INFO L84 Accepts]: Finished accepts. word is rejected. 122.49/77.70 [2019-03-28 12:35:15,537 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 29 transitions. 122.49/77.70 [2019-03-28 12:35:15,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 122.49/77.70 [2019-03-28 12:35:15,537 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. 122.49/77.70 [2019-03-28 12:35:15,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 122.49/77.70 [2019-03-28 12:35:15,537 INFO L394 BasicCegarLoop]: Found error trace 122.49/77.70 [2019-03-28 12:35:15,538 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 122.49/77.70 [2019-03-28 12:35:15,538 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 122.49/77.70 [2019-03-28 12:35:15,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.49/77.70 [2019-03-28 12:35:15,538 INFO L82 PathProgramCache]: Analyzing trace with hash -890467846, now seen corresponding path program 1 times 122.49/77.70 [2019-03-28 12:35:15,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.49/77.70 [2019-03-28 12:35:15,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.49/77.70 [2019-03-28 12:35:15,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:15,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:15,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.70 [2019-03-28 12:35:15,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 122.49/77.70 [2019-03-28 12:35:15,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 122.49/77.70 [2019-03-28 12:35:15,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 122.49/77.70 [2019-03-28 12:35:15,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 122.49/77.70 [2019-03-28 12:35:15,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 122.49/77.70 [2019-03-28 12:35:15,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 122.49/77.70 [2019-03-28 12:35:15,605 INFO L87 Difference]: Start difference. First operand 18 states and 29 transitions. Second operand 6 states. 122.49/77.70 [2019-03-28 12:35:15,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 122.49/77.70 [2019-03-28 12:35:15,700 INFO L93 Difference]: Finished difference Result 23 states and 36 transitions. 122.49/77.70 [2019-03-28 12:35:15,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 122.49/77.70 [2019-03-28 12:35:15,701 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 122.49/77.70 [2019-03-28 12:35:15,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 122.49/77.70 [2019-03-28 12:35:15,701 INFO L225 Difference]: With dead ends: 23 122.49/77.70 [2019-03-28 12:35:15,702 INFO L226 Difference]: Without dead ends: 22 122.49/77.70 [2019-03-28 12:35:15,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 122.49/77.70 [2019-03-28 12:35:15,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. 122.49/77.70 [2019-03-28 12:35:15,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. 122.49/77.70 [2019-03-28 12:35:15,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 122.49/77.70 [2019-03-28 12:35:15,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 32 transitions. 122.49/77.70 [2019-03-28 12:35:15,707 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 32 transitions. Word has length 10 122.49/77.70 [2019-03-28 12:35:15,707 INFO L84 Accepts]: Finished accepts. word is rejected. 122.49/77.70 [2019-03-28 12:35:15,707 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 32 transitions. 122.49/77.70 [2019-03-28 12:35:15,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 122.49/77.70 [2019-03-28 12:35:15,707 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. 122.49/77.70 [2019-03-28 12:35:15,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 122.49/77.70 [2019-03-28 12:35:15,708 INFO L394 BasicCegarLoop]: Found error trace 122.49/77.70 [2019-03-28 12:35:15,708 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 122.49/77.70 [2019-03-28 12:35:15,708 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 122.49/77.70 [2019-03-28 12:35:15,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.49/77.70 [2019-03-28 12:35:15,708 INFO L82 PathProgramCache]: Analyzing trace with hash -890467845, now seen corresponding path program 1 times 122.49/77.70 [2019-03-28 12:35:15,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.49/77.70 [2019-03-28 12:35:15,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.49/77.70 [2019-03-28 12:35:15,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:15,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:15,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:15,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.70 [2019-03-28 12:35:15,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 122.49/77.70 [2019-03-28 12:35:15,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 122.49/77.70 [2019-03-28 12:35:15,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 122.49/77.70 [2019-03-28 12:35:15,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 122.49/77.70 [2019-03-28 12:35:15,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 122.49/77.70 [2019-03-28 12:35:15,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 122.49/77.70 [2019-03-28 12:35:15,786 INFO L87 Difference]: Start difference. First operand 20 states and 32 transitions. Second operand 7 states. 122.49/77.70 [2019-03-28 12:35:15,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 122.49/77.70 [2019-03-28 12:35:15,917 INFO L93 Difference]: Finished difference Result 22 states and 35 transitions. 122.49/77.70 [2019-03-28 12:35:15,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 122.49/77.70 [2019-03-28 12:35:15,918 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 122.49/77.70 [2019-03-28 12:35:15,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 122.49/77.70 [2019-03-28 12:35:15,919 INFO L225 Difference]: With dead ends: 22 122.49/77.70 [2019-03-28 12:35:15,919 INFO L226 Difference]: Without dead ends: 21 122.49/77.70 [2019-03-28 12:35:15,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 122.49/77.70 [2019-03-28 12:35:15,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. 122.49/77.70 [2019-03-28 12:35:15,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. 122.49/77.70 [2019-03-28 12:35:15,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 122.49/77.70 [2019-03-28 12:35:15,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. 122.49/77.70 [2019-03-28 12:35:15,923 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 31 transitions. Word has length 10 122.49/77.70 [2019-03-28 12:35:15,923 INFO L84 Accepts]: Finished accepts. word is rejected. 122.49/77.70 [2019-03-28 12:35:15,923 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 31 transitions. 122.49/77.70 [2019-03-28 12:35:15,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 122.49/77.70 [2019-03-28 12:35:15,923 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 31 transitions. 122.49/77.70 [2019-03-28 12:35:15,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 122.49/77.70 [2019-03-28 12:35:15,924 INFO L394 BasicCegarLoop]: Found error trace 122.49/77.70 [2019-03-28 12:35:15,924 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 122.49/77.70 [2019-03-28 12:35:15,924 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 122.49/77.70 [2019-03-28 12:35:15,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.49/77.70 [2019-03-28 12:35:15,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1041090507, now seen corresponding path program 1 times 122.49/77.70 [2019-03-28 12:35:15,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.49/77.70 [2019-03-28 12:35:15,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.49/77.70 [2019-03-28 12:35:15,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:15,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:15,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.70 [2019-03-28 12:35:15,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 122.49/77.70 [2019-03-28 12:35:15,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 122.49/77.70 [2019-03-28 12:35:15,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 122.49/77.70 [2019-03-28 12:35:15,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 122.49/77.70 [2019-03-28 12:35:15,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 122.49/77.70 [2019-03-28 12:35:15,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 122.49/77.70 [2019-03-28 12:35:15,962 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. Second operand 3 states. 122.49/77.70 [2019-03-28 12:35:15,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 122.49/77.70 [2019-03-28 12:35:15,988 INFO L93 Difference]: Finished difference Result 21 states and 31 transitions. 122.49/77.70 [2019-03-28 12:35:15,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 122.49/77.70 [2019-03-28 12:35:15,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 122.49/77.70 [2019-03-28 12:35:15,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 122.49/77.70 [2019-03-28 12:35:15,989 INFO L225 Difference]: With dead ends: 21 122.49/77.70 [2019-03-28 12:35:15,989 INFO L226 Difference]: Without dead ends: 20 122.49/77.70 [2019-03-28 12:35:15,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 122.49/77.70 [2019-03-28 12:35:15,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. 122.49/77.70 [2019-03-28 12:35:15,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. 122.49/77.70 [2019-03-28 12:35:15,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 122.49/77.70 [2019-03-28 12:35:15,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions. 122.49/77.70 [2019-03-28 12:35:15,994 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 30 transitions. Word has length 12 122.49/77.70 [2019-03-28 12:35:15,994 INFO L84 Accepts]: Finished accepts. word is rejected. 122.49/77.70 [2019-03-28 12:35:15,994 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 30 transitions. 122.49/77.70 [2019-03-28 12:35:15,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 122.49/77.70 [2019-03-28 12:35:15,994 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 30 transitions. 122.49/77.70 [2019-03-28 12:35:15,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 122.49/77.70 [2019-03-28 12:35:15,995 INFO L394 BasicCegarLoop]: Found error trace 122.49/77.70 [2019-03-28 12:35:15,995 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 122.49/77.70 [2019-03-28 12:35:15,995 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 122.49/77.70 [2019-03-28 12:35:15,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.49/77.70 [2019-03-28 12:35:15,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1041090506, now seen corresponding path program 1 times 122.49/77.70 [2019-03-28 12:35:15,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.49/77.70 [2019-03-28 12:35:15,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.49/77.70 [2019-03-28 12:35:15,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:15,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:15,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.70 [2019-03-28 12:35:16,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 122.49/77.70 [2019-03-28 12:35:16,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 122.49/77.70 [2019-03-28 12:35:16,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 122.49/77.70 [2019-03-28 12:35:16,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 122.49/77.70 [2019-03-28 12:35:16,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 122.49/77.70 [2019-03-28 12:35:16,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 122.49/77.70 [2019-03-28 12:35:16,027 INFO L87 Difference]: Start difference. First operand 20 states and 30 transitions. Second operand 3 states. 122.49/77.70 [2019-03-28 12:35:16,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 122.49/77.70 [2019-03-28 12:35:16,055 INFO L93 Difference]: Finished difference Result 20 states and 30 transitions. 122.49/77.70 [2019-03-28 12:35:16,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 122.49/77.70 [2019-03-28 12:35:16,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 122.49/77.70 [2019-03-28 12:35:16,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 122.49/77.70 [2019-03-28 12:35:16,056 INFO L225 Difference]: With dead ends: 20 122.49/77.70 [2019-03-28 12:35:16,056 INFO L226 Difference]: Without dead ends: 18 122.49/77.70 [2019-03-28 12:35:16,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 122.49/77.70 [2019-03-28 12:35:16,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. 122.49/77.70 [2019-03-28 12:35:16,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. 122.49/77.70 [2019-03-28 12:35:16,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 122.49/77.70 [2019-03-28 12:35:16,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. 122.49/77.70 [2019-03-28 12:35:16,060 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 28 transitions. Word has length 12 122.49/77.70 [2019-03-28 12:35:16,060 INFO L84 Accepts]: Finished accepts. word is rejected. 122.49/77.70 [2019-03-28 12:35:16,060 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 28 transitions. 122.49/77.70 [2019-03-28 12:35:16,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 122.49/77.70 [2019-03-28 12:35:16,061 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 28 transitions. 122.49/77.70 [2019-03-28 12:35:16,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 122.49/77.70 [2019-03-28 12:35:16,061 INFO L394 BasicCegarLoop]: Found error trace 122.49/77.70 [2019-03-28 12:35:16,061 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 122.49/77.70 [2019-03-28 12:35:16,062 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 122.49/77.70 [2019-03-28 12:35:16,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.49/77.70 [2019-03-28 12:35:16,062 INFO L82 PathProgramCache]: Analyzing trace with hash 240598607, now seen corresponding path program 1 times 122.49/77.70 [2019-03-28 12:35:16,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.49/77.70 [2019-03-28 12:35:16,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.49/77.70 [2019-03-28 12:35:16,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:16,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:16,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:16,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.70 [2019-03-28 12:35:16,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 122.49/77.70 [2019-03-28 12:35:16,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 122.49/77.70 [2019-03-28 12:35:16,125 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 122.49/77.70 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 122.49/77.70 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 122.49/77.70 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 122.49/77.70 [2019-03-28 12:35:16,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:16,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.70 [2019-03-28 12:35:16,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core 122.49/77.70 [2019-03-28 12:35:16,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... 122.49/77.70 [2019-03-28 12:35:16,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 122.49/77.70 [2019-03-28 12:35:16,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 122.49/77.70 [2019-03-28 12:35:16,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 122.49/77.70 [2019-03-28 12:35:16,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states 122.49/77.70 [2019-03-28 12:35:16,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 122.49/77.70 [2019-03-28 12:35:16,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 122.49/77.70 [2019-03-28 12:35:16,245 INFO L87 Difference]: Start difference. First operand 18 states and 28 transitions. Second operand 8 states. 122.49/77.70 [2019-03-28 12:35:16,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 122.49/77.70 [2019-03-28 12:35:16,381 INFO L93 Difference]: Finished difference Result 19 states and 28 transitions. 122.49/77.70 [2019-03-28 12:35:16,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 122.49/77.70 [2019-03-28 12:35:16,382 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 122.49/77.70 [2019-03-28 12:35:16,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 122.49/77.70 [2019-03-28 12:35:16,382 INFO L225 Difference]: With dead ends: 19 122.49/77.70 [2019-03-28 12:35:16,383 INFO L226 Difference]: Without dead ends: 18 122.49/77.70 [2019-03-28 12:35:16,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 122.49/77.70 [2019-03-28 12:35:16,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. 122.49/77.70 [2019-03-28 12:35:16,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. 122.49/77.70 [2019-03-28 12:35:16,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 122.49/77.70 [2019-03-28 12:35:16,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 27 transitions. 122.49/77.70 [2019-03-28 12:35:16,386 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 27 transitions. Word has length 14 122.49/77.70 [2019-03-28 12:35:16,386 INFO L84 Accepts]: Finished accepts. word is rejected. 122.49/77.70 [2019-03-28 12:35:16,387 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 27 transitions. 122.49/77.70 [2019-03-28 12:35:16,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. 122.49/77.70 [2019-03-28 12:35:16,387 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 27 transitions. 122.49/77.70 [2019-03-28 12:35:16,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 122.49/77.70 [2019-03-28 12:35:16,387 INFO L394 BasicCegarLoop]: Found error trace 122.49/77.70 [2019-03-28 12:35:16,388 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 122.49/77.70 [2019-03-28 12:35:16,388 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 122.49/77.70 [2019-03-28 12:35:16,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.49/77.70 [2019-03-28 12:35:16,388 INFO L82 PathProgramCache]: Analyzing trace with hash 240598608, now seen corresponding path program 1 times 122.49/77.70 [2019-03-28 12:35:16,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.49/77.70 [2019-03-28 12:35:16,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.49/77.70 [2019-03-28 12:35:16,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:16,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:16,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.70 [2019-03-28 12:35:16,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.70 [2019-03-28 12:35:16,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 122.49/77.70 [2019-03-28 12:35:16,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 122.49/77.70 [2019-03-28 12:35:16,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 122.49/77.70 [2019-03-28 12:35:16,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states 122.49/77.70 [2019-03-28 12:35:16,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 122.49/77.70 [2019-03-28 12:35:16,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 122.49/77.70 [2019-03-28 12:35:16,518 INFO L87 Difference]: Start difference. First operand 18 states and 27 transitions. Second operand 9 states. 122.49/77.70 [2019-03-28 12:35:16,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 122.49/77.71 [2019-03-28 12:35:16,807 INFO L93 Difference]: Finished difference Result 64 states and 94 transitions. 122.49/77.71 [2019-03-28 12:35:16,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 122.49/77.71 [2019-03-28 12:35:16,808 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 122.49/77.71 [2019-03-28 12:35:16,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 122.49/77.71 [2019-03-28 12:35:16,809 INFO L225 Difference]: With dead ends: 64 122.49/77.71 [2019-03-28 12:35:16,809 INFO L226 Difference]: Without dead ends: 54 122.49/77.71 [2019-03-28 12:35:16,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 122.49/77.71 [2019-03-28 12:35:16,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. 122.49/77.71 [2019-03-28 12:35:16,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 31. 122.49/77.71 [2019-03-28 12:35:16,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 122.49/77.71 [2019-03-28 12:35:16,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 49 transitions. 122.49/77.71 [2019-03-28 12:35:16,816 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 49 transitions. Word has length 14 122.49/77.71 [2019-03-28 12:35:16,816 INFO L84 Accepts]: Finished accepts. word is rejected. 122.49/77.71 [2019-03-28 12:35:16,816 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 49 transitions. 122.49/77.71 [2019-03-28 12:35:16,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. 122.49/77.71 [2019-03-28 12:35:16,817 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 49 transitions. 122.49/77.71 [2019-03-28 12:35:16,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 122.49/77.71 [2019-03-28 12:35:16,817 INFO L394 BasicCegarLoop]: Found error trace 122.49/77.71 [2019-03-28 12:35:16,817 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 122.49/77.71 [2019-03-28 12:35:16,818 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 122.49/77.71 [2019-03-28 12:35:16,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.49/77.71 [2019-03-28 12:35:16,818 INFO L82 PathProgramCache]: Analyzing trace with hash 240663091, now seen corresponding path program 1 times 122.49/77.71 [2019-03-28 12:35:16,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.49/77.71 [2019-03-28 12:35:16,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.49/77.71 [2019-03-28 12:35:16,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:35:16,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:35:16,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:35:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.71 [2019-03-28 12:35:16,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 122.49/77.71 [2019-03-28 12:35:16,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 122.49/77.71 [2019-03-28 12:35:16,883 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 122.49/77.71 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 122.49/77.71 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 122.49/77.71 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 122.49/77.71 [2019-03-28 12:35:16,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:35:16,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.71 [2019-03-28 12:35:16,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjunts are in the unsatisfiable core 122.49/77.71 [2019-03-28 12:35:16,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... 122.49/77.71 [2019-03-28 12:35:16,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 122.49/77.71 [2019-03-28 12:35:16,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 122.49/77.71 [2019-03-28 12:35:16,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 8 122.49/77.71 [2019-03-28 12:35:16,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states 122.49/77.71 [2019-03-28 12:35:16,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 122.49/77.71 [2019-03-28 12:35:16,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 122.49/77.71 [2019-03-28 12:35:16,970 INFO L87 Difference]: Start difference. First operand 31 states and 49 transitions. Second operand 9 states. 122.49/77.71 [2019-03-28 12:35:17,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 122.49/77.71 [2019-03-28 12:35:17,142 INFO L93 Difference]: Finished difference Result 34 states and 53 transitions. 122.49/77.71 [2019-03-28 12:35:17,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 122.49/77.71 [2019-03-28 12:35:17,142 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 122.49/77.71 [2019-03-28 12:35:17,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 122.49/77.71 [2019-03-28 12:35:17,143 INFO L225 Difference]: With dead ends: 34 122.49/77.71 [2019-03-28 12:35:17,143 INFO L226 Difference]: Without dead ends: 33 122.49/77.71 [2019-03-28 12:35:17,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 122.49/77.71 [2019-03-28 12:35:17,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. 122.49/77.71 [2019-03-28 12:35:17,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. 122.49/77.71 [2019-03-28 12:35:17,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 122.49/77.71 [2019-03-28 12:35:17,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 47 transitions. 122.49/77.71 [2019-03-28 12:35:17,149 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 47 transitions. Word has length 14 122.49/77.71 [2019-03-28 12:35:17,149 INFO L84 Accepts]: Finished accepts. word is rejected. 122.49/77.71 [2019-03-28 12:35:17,149 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 47 transitions. 122.49/77.71 [2019-03-28 12:35:17,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. 122.49/77.71 [2019-03-28 12:35:17,150 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 47 transitions. 122.49/77.71 [2019-03-28 12:35:17,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 122.49/77.71 [2019-03-28 12:35:17,150 INFO L394 BasicCegarLoop]: Found error trace 122.49/77.71 [2019-03-28 12:35:17,150 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 122.49/77.71 [2019-03-28 12:35:17,151 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 122.49/77.71 [2019-03-28 12:35:17,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.49/77.71 [2019-03-28 12:35:17,151 INFO L82 PathProgramCache]: Analyzing trace with hash 240663092, now seen corresponding path program 1 times 122.49/77.71 [2019-03-28 12:35:17,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.49/77.71 [2019-03-28 12:35:17,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.49/77.71 [2019-03-28 12:35:17,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:35:17,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:35:17,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:35:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.71 [2019-03-28 12:35:17,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 122.49/77.71 [2019-03-28 12:35:17,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 122.49/77.71 [2019-03-28 12:35:17,303 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 122.49/77.71 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 122.49/77.71 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 122.49/77.71 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 122.49/77.71 [2019-03-28 12:35:17,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:35:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.71 [2019-03-28 12:35:17,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 29 conjunts are in the unsatisfiable core 122.49/77.71 [2019-03-28 12:35:17,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... 122.49/77.71 [2019-03-28 12:35:17,394 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:17,394 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 122.49/77.71 [2019-03-28 12:35:17,395 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:17,416 INFO L497 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size 122.49/77.71 [2019-03-28 12:35:17,417 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:17,418 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 122.49/77.71 [2019-03-28 12:35:17,446 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 122.49/77.71 [2019-03-28 12:35:17,447 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:17,456 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:17,457 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:17,457 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 122.49/77.71 [2019-03-28 12:35:17,585 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:17,586 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 122.49/77.71 [2019-03-28 12:35:17,590 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 122.49/77.71 [2019-03-28 12:35:17,605 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:17,609 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:17,610 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:34 122.49/77.71 [2019-03-28 12:35:17,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 122.49/77.71 [2019-03-28 12:35:17,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 122.49/77.71 [2019-03-28 12:35:17,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 122.49/77.71 [2019-03-28 12:35:17,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states 122.49/77.71 [2019-03-28 12:35:17,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. 122.49/77.71 [2019-03-28 12:35:17,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 122.49/77.71 [2019-03-28 12:35:17,759 INFO L87 Difference]: Start difference. First operand 31 states and 47 transitions. Second operand 17 states. 122.49/77.71 [2019-03-28 12:35:18,245 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 122.49/77.71 [2019-03-28 12:35:18,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 122.49/77.71 [2019-03-28 12:35:18,657 INFO L93 Difference]: Finished difference Result 46 states and 71 transitions. 122.49/77.71 [2019-03-28 12:35:18,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 122.49/77.71 [2019-03-28 12:35:18,657 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 14 122.49/77.71 [2019-03-28 12:35:18,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 122.49/77.71 [2019-03-28 12:35:18,658 INFO L225 Difference]: With dead ends: 46 122.49/77.71 [2019-03-28 12:35:18,658 INFO L226 Difference]: Without dead ends: 45 122.49/77.71 [2019-03-28 12:35:18,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 122.49/77.71 [2019-03-28 12:35:18,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. 122.49/77.71 [2019-03-28 12:35:18,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. 122.49/77.71 [2019-03-28 12:35:18,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. 122.49/77.71 [2019-03-28 12:35:18,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 62 transitions. 122.49/77.71 [2019-03-28 12:35:18,667 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 62 transitions. Word has length 14 122.49/77.71 [2019-03-28 12:35:18,667 INFO L84 Accepts]: Finished accepts. word is rejected. 122.49/77.71 [2019-03-28 12:35:18,667 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 62 transitions. 122.49/77.71 [2019-03-28 12:35:18,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. 122.49/77.71 [2019-03-28 12:35:18,667 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 62 transitions. 122.49/77.71 [2019-03-28 12:35:18,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 122.49/77.71 [2019-03-28 12:35:18,668 INFO L394 BasicCegarLoop]: Found error trace 122.49/77.71 [2019-03-28 12:35:18,668 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 122.49/77.71 [2019-03-28 12:35:18,668 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 122.49/77.71 [2019-03-28 12:35:18,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.49/77.71 [2019-03-28 12:35:18,669 INFO L82 PathProgramCache]: Analyzing trace with hash 240628399, now seen corresponding path program 1 times 122.49/77.71 [2019-03-28 12:35:18,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.49/77.71 [2019-03-28 12:35:18,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.49/77.71 [2019-03-28 12:35:18,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:35:18,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:35:18,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:35:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.71 [2019-03-28 12:35:18,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 122.49/77.71 [2019-03-28 12:35:18,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 122.49/77.71 [2019-03-28 12:35:18,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 122.49/77.71 [2019-03-28 12:35:18,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states 122.49/77.71 [2019-03-28 12:35:18,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 122.49/77.71 [2019-03-28 12:35:18,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 122.49/77.71 [2019-03-28 12:35:18,791 INFO L87 Difference]: Start difference. First operand 40 states and 62 transitions. Second operand 9 states. 122.49/77.71 [2019-03-28 12:35:19,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 122.49/77.71 [2019-03-28 12:35:19,016 INFO L93 Difference]: Finished difference Result 72 states and 103 transitions. 122.49/77.71 [2019-03-28 12:35:19,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 122.49/77.71 [2019-03-28 12:35:19,016 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 122.49/77.71 [2019-03-28 12:35:19,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 122.49/77.71 [2019-03-28 12:35:19,017 INFO L225 Difference]: With dead ends: 72 122.49/77.71 [2019-03-28 12:35:19,017 INFO L226 Difference]: Without dead ends: 51 122.49/77.71 [2019-03-28 12:35:19,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 122.49/77.71 [2019-03-28 12:35:19,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. 122.49/77.71 [2019-03-28 12:35:19,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. 122.49/77.71 [2019-03-28 12:35:19,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. 122.49/77.71 [2019-03-28 12:35:19,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. 122.49/77.71 [2019-03-28 12:35:19,026 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 14 122.49/77.71 [2019-03-28 12:35:19,026 INFO L84 Accepts]: Finished accepts. word is rejected. 122.49/77.71 [2019-03-28 12:35:19,026 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. 122.49/77.71 [2019-03-28 12:35:19,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. 122.49/77.71 [2019-03-28 12:35:19,026 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. 122.49/77.71 [2019-03-28 12:35:19,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 122.49/77.71 [2019-03-28 12:35:19,027 INFO L394 BasicCegarLoop]: Found error trace 122.49/77.71 [2019-03-28 12:35:19,027 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 122.49/77.71 [2019-03-28 12:35:19,027 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 122.49/77.71 [2019-03-28 12:35:19,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.49/77.71 [2019-03-28 12:35:19,028 INFO L82 PathProgramCache]: Analyzing trace with hash -452285215, now seen corresponding path program 1 times 122.49/77.71 [2019-03-28 12:35:19,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.49/77.71 [2019-03-28 12:35:19,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.49/77.71 [2019-03-28 12:35:19,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:35:19,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:35:19,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:35:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.71 [2019-03-28 12:35:19,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 122.49/77.71 [2019-03-28 12:35:19,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 122.49/77.71 [2019-03-28 12:35:19,225 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 122.49/77.71 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 122.49/77.71 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 122.49/77.71 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 122.49/77.71 [2019-03-28 12:35:19,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:35:19,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.71 [2019-03-28 12:35:19,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 32 conjunts are in the unsatisfiable core 122.49/77.71 [2019-03-28 12:35:19,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... 122.49/77.71 [2019-03-28 12:35:19,305 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 122.49/77.71 [2019-03-28 12:35:19,306 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:19,318 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:19,319 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:19,319 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:27 122.49/77.71 [2019-03-28 12:35:19,362 INFO L189 IndexEqualityManager]: detected not equals via solver 122.49/77.71 [2019-03-28 12:35:19,364 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 122.49/77.71 [2019-03-28 12:35:19,365 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:19,379 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:19,380 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:19,381 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:44, output treesize:40 122.49/77.71 [2019-03-28 12:35:19,475 INFO L189 IndexEqualityManager]: detected not equals via solver 122.49/77.71 [2019-03-28 12:35:19,482 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:19,483 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 21 122.49/77.71 [2019-03-28 12:35:19,484 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 122.49/77.71 [2019-03-28 12:35:19,510 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:19,514 INFO L427 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:19,514 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:52, output treesize:27 122.49/77.71 [2019-03-28 12:35:19,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 122.49/77.71 [2019-03-28 12:35:19,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 122.49/77.71 [2019-03-28 12:35:19,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 122.49/77.71 [2019-03-28 12:35:19,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states 122.49/77.71 [2019-03-28 12:35:19,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. 122.49/77.71 [2019-03-28 12:35:19,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 122.49/77.71 [2019-03-28 12:35:19,696 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 19 states. 122.49/77.71 [2019-03-28 12:35:21,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 122.49/77.71 [2019-03-28 12:35:21,055 INFO L93 Difference]: Finished difference Result 149 states and 205 transitions. 122.49/77.71 [2019-03-28 12:35:21,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 122.49/77.71 [2019-03-28 12:35:21,056 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 14 122.49/77.71 [2019-03-28 12:35:21,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 122.49/77.71 [2019-03-28 12:35:21,057 INFO L225 Difference]: With dead ends: 149 122.49/77.71 [2019-03-28 12:35:21,057 INFO L226 Difference]: Without dead ends: 148 122.49/77.71 [2019-03-28 12:35:21,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=263, Invalid=997, Unknown=0, NotChecked=0, Total=1260 122.49/77.71 [2019-03-28 12:35:21,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. 122.49/77.71 [2019-03-28 12:35:21,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 60. 122.49/77.71 [2019-03-28 12:35:21,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. 122.49/77.71 [2019-03-28 12:35:21,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 93 transitions. 122.49/77.71 [2019-03-28 12:35:21,072 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 93 transitions. Word has length 14 122.49/77.71 [2019-03-28 12:35:21,072 INFO L84 Accepts]: Finished accepts. word is rejected. 122.49/77.71 [2019-03-28 12:35:21,072 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 93 transitions. 122.49/77.71 [2019-03-28 12:35:21,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. 122.49/77.71 [2019-03-28 12:35:21,072 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 93 transitions. 122.49/77.71 [2019-03-28 12:35:21,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 122.49/77.71 [2019-03-28 12:35:21,073 INFO L394 BasicCegarLoop]: Found error trace 122.49/77.71 [2019-03-28 12:35:21,073 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 122.49/77.71 [2019-03-28 12:35:21,073 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 122.49/77.71 [2019-03-28 12:35:21,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.49/77.71 [2019-03-28 12:35:21,074 INFO L82 PathProgramCache]: Analyzing trace with hash -452255424, now seen corresponding path program 1 times 122.49/77.71 [2019-03-28 12:35:21,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.49/77.71 [2019-03-28 12:35:21,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.49/77.71 [2019-03-28 12:35:21,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:35:21,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:35:21,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:35:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.71 [2019-03-28 12:35:21,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 122.49/77.71 [2019-03-28 12:35:21,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 122.49/77.71 [2019-03-28 12:35:21,254 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 122.49/77.71 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 122.49/77.71 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 122.49/77.71 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 122.49/77.71 [2019-03-28 12:35:21,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:35:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.71 [2019-03-28 12:35:21,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 32 conjunts are in the unsatisfiable core 122.49/77.71 [2019-03-28 12:35:21,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... 122.49/77.71 [2019-03-28 12:35:21,311 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 122.49/77.71 [2019-03-28 12:35:21,311 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:21,320 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:21,321 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:21,321 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:27 122.49/77.71 [2019-03-28 12:35:21,352 INFO L189 IndexEqualityManager]: detected not equals via solver 122.49/77.71 [2019-03-28 12:35:21,354 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 122.49/77.71 [2019-03-28 12:35:21,354 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:21,367 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:21,368 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:21,368 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:44, output treesize:40 122.49/77.71 [2019-03-28 12:35:21,449 INFO L189 IndexEqualityManager]: detected not equals via solver 122.49/77.71 [2019-03-28 12:35:21,454 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:21,455 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 21 122.49/77.71 [2019-03-28 12:35:21,456 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 122.49/77.71 [2019-03-28 12:35:21,470 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:21,473 INFO L427 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:21,473 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:52, output treesize:27 122.49/77.71 [2019-03-28 12:35:21,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 122.49/77.71 [2019-03-28 12:35:21,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 122.49/77.71 [2019-03-28 12:35:21,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 122.49/77.71 [2019-03-28 12:35:21,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states 122.49/77.71 [2019-03-28 12:35:21,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. 122.49/77.71 [2019-03-28 12:35:21,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 122.49/77.71 [2019-03-28 12:35:21,616 INFO L87 Difference]: Start difference. First operand 60 states and 93 transitions. Second operand 19 states. 122.49/77.71 [2019-03-28 12:35:23,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 122.49/77.71 [2019-03-28 12:35:23,051 INFO L93 Difference]: Finished difference Result 183 states and 265 transitions. 122.49/77.71 [2019-03-28 12:35:23,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 122.49/77.71 [2019-03-28 12:35:23,051 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 14 122.49/77.71 [2019-03-28 12:35:23,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 122.49/77.71 [2019-03-28 12:35:23,053 INFO L225 Difference]: With dead ends: 183 122.49/77.71 [2019-03-28 12:35:23,053 INFO L226 Difference]: Without dead ends: 182 122.49/77.71 [2019-03-28 12:35:23,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=263, Invalid=997, Unknown=0, NotChecked=0, Total=1260 122.49/77.71 [2019-03-28 12:35:23,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. 122.49/77.71 [2019-03-28 12:35:23,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 52. 122.49/77.71 [2019-03-28 12:35:23,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. 122.49/77.71 [2019-03-28 12:35:23,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 77 transitions. 122.49/77.71 [2019-03-28 12:35:23,065 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 77 transitions. Word has length 14 122.49/77.71 [2019-03-28 12:35:23,066 INFO L84 Accepts]: Finished accepts. word is rejected. 122.49/77.71 [2019-03-28 12:35:23,066 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 77 transitions. 122.49/77.71 [2019-03-28 12:35:23,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. 122.49/77.71 [2019-03-28 12:35:23,066 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 77 transitions. 122.49/77.71 [2019-03-28 12:35:23,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 122.49/77.71 [2019-03-28 12:35:23,067 INFO L394 BasicCegarLoop]: Found error trace 122.49/77.71 [2019-03-28 12:35:23,067 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 122.49/77.71 [2019-03-28 12:35:23,067 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 122.49/77.71 [2019-03-28 12:35:23,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.49/77.71 [2019-03-28 12:35:23,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1468999149, now seen corresponding path program 2 times 122.49/77.71 [2019-03-28 12:35:23,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.49/77.71 [2019-03-28 12:35:23,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.49/77.71 [2019-03-28 12:35:23,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:35:23,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:35:23,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:35:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.71 [2019-03-28 12:35:23,270 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 122.49/77.71 [2019-03-28 12:35:23,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 122.49/77.71 [2019-03-28 12:35:23,270 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 122.49/77.71 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 122.49/77.71 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 122.49/77.71 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 122.49/77.71 [2019-03-28 12:35:23,281 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 122.49/77.71 [2019-03-28 12:35:23,310 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 122.49/77.71 [2019-03-28 12:35:23,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 122.49/77.71 [2019-03-28 12:35:23,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 31 conjunts are in the unsatisfiable core 122.49/77.71 [2019-03-28 12:35:23,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... 122.49/77.71 [2019-03-28 12:35:23,331 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:23,331 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 122.49/77.71 [2019-03-28 12:35:23,332 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:23,348 INFO L497 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size 122.49/77.71 [2019-03-28 12:35:23,348 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:23,349 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 122.49/77.71 [2019-03-28 12:35:23,369 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 122.49/77.71 [2019-03-28 12:35:23,369 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:23,371 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:23,372 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:23,372 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 122.49/77.71 [2019-03-28 12:35:23,447 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:23,448 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 122.49/77.71 [2019-03-28 12:35:23,449 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 122.49/77.71 [2019-03-28 12:35:23,457 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:23,459 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 122.49/77.71 [2019-03-28 12:35:23,459 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 122.49/77.71 [2019-03-28 12:35:23,494 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 122.49/77.71 [2019-03-28 12:35:23,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 122.49/77.71 [2019-03-28 12:35:23,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 122.49/77.71 [2019-03-28 12:35:23,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states 122.49/77.71 [2019-03-28 12:35:23,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. 122.49/77.71 [2019-03-28 12:35:23,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 122.49/77.71 [2019-03-28 12:35:23,523 INFO L87 Difference]: Start difference. First operand 52 states and 77 transitions. Second operand 16 states. 122.49/77.71 [2019-03-28 12:35:24,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 122.49/77.71 [2019-03-28 12:35:24,386 INFO L93 Difference]: Finished difference Result 60 states and 88 transitions. 122.49/77.71 [2019-03-28 12:35:24,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 122.49/77.71 [2019-03-28 12:35:24,390 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 122.49/77.71 [2019-03-28 12:35:24,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 122.49/77.71 [2019-03-28 12:35:24,391 INFO L225 Difference]: With dead ends: 60 122.49/77.71 [2019-03-28 12:35:24,391 INFO L226 Difference]: Without dead ends: 40 122.49/77.71 [2019-03-28 12:35:24,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=184, Invalid=572, Unknown=0, NotChecked=0, Total=756 122.49/77.71 [2019-03-28 12:35:24,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. 122.49/77.71 [2019-03-28 12:35:24,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 21. 122.49/77.71 [2019-03-28 12:35:24,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 122.49/77.71 [2019-03-28 12:35:24,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. 122.49/77.71 [2019-03-28 12:35:24,397 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 18 122.49/77.71 [2019-03-28 12:35:24,398 INFO L84 Accepts]: Finished accepts. word is rejected. 122.49/77.71 [2019-03-28 12:35:24,398 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. 122.49/77.71 [2019-03-28 12:35:24,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. 122.49/77.71 [2019-03-28 12:35:24,398 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. 122.49/77.71 [2019-03-28 12:35:24,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 122.49/77.71 [2019-03-28 12:35:24,398 INFO L394 BasicCegarLoop]: Found error trace 122.49/77.71 [2019-03-28 12:35:24,399 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] 122.49/77.71 [2019-03-28 12:35:24,399 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 122.49/77.71 [2019-03-28 12:35:24,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.49/77.71 [2019-03-28 12:35:24,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1405328983, now seen corresponding path program 2 times 122.49/77.71 [2019-03-28 12:35:24,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.49/77.71 [2019-03-28 12:35:24,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.49/77.71 [2019-03-28 12:35:24,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:35:24,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:35:24,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:35:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.71 [2019-03-28 12:35:24,639 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 122.49/77.71 [2019-03-28 12:35:24,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 122.49/77.71 [2019-03-28 12:35:24,640 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 122.49/77.71 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 122.49/77.71 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 122.49/77.71 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 122.49/77.71 [2019-03-28 12:35:24,652 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 122.49/77.71 [2019-03-28 12:35:24,678 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 122.49/77.71 [2019-03-28 12:35:24,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 122.49/77.71 [2019-03-28 12:35:24,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 35 conjunts are in the unsatisfiable core 122.49/77.71 [2019-03-28 12:35:24,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... 122.49/77.71 [2019-03-28 12:35:24,688 INFO L189 IndexEqualityManager]: detected not equals via solver 122.49/77.71 [2019-03-28 12:35:24,689 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 122.49/77.71 [2019-03-28 12:35:24,690 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:24,697 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:24,698 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:24,698 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:20 122.49/77.71 [2019-03-28 12:35:24,725 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 122.49/77.71 [2019-03-28 12:35:24,725 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:24,735 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:24,736 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:24,736 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 122.49/77.71 [2019-03-28 12:35:24,771 INFO L189 IndexEqualityManager]: detected not equals via solver 122.49/77.71 [2019-03-28 12:35:24,772 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 122.49/77.71 [2019-03-28 12:35:24,772 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:24,783 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:24,784 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:24,784 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:37 122.49/77.71 [2019-03-28 12:35:24,892 INFO L189 IndexEqualityManager]: detected not equals via solver 122.49/77.71 [2019-03-28 12:35:24,899 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:24,899 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 122.49/77.71 [2019-03-28 12:35:24,900 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 122.49/77.71 [2019-03-28 12:35:24,915 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:24,918 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:24,918 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:27 122.49/77.71 [2019-03-28 12:35:25,063 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 122.49/77.71 [2019-03-28 12:35:25,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 122.49/77.71 [2019-03-28 12:35:25,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 122.49/77.71 [2019-03-28 12:35:25,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states 122.49/77.71 [2019-03-28 12:35:25,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. 122.49/77.71 [2019-03-28 12:35:25,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 122.49/77.71 [2019-03-28 12:35:25,092 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand 20 states. 122.49/77.71 [2019-03-28 12:35:25,811 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 122.49/77.71 [2019-03-28 12:35:26,021 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 122.49/77.71 [2019-03-28 12:35:26,629 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 122.49/77.71 [2019-03-28 12:35:27,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 122.49/77.71 [2019-03-28 12:35:27,425 INFO L93 Difference]: Finished difference Result 75 states and 110 transitions. 122.49/77.71 [2019-03-28 12:35:27,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. 122.49/77.71 [2019-03-28 12:35:27,426 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 122.49/77.71 [2019-03-28 12:35:27,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 122.49/77.71 [2019-03-28 12:35:27,426 INFO L225 Difference]: With dead ends: 75 122.49/77.71 [2019-03-28 12:35:27,427 INFO L226 Difference]: Without dead ends: 74 122.49/77.71 [2019-03-28 12:35:27,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=344, Invalid=1636, Unknown=0, NotChecked=0, Total=1980 122.49/77.71 [2019-03-28 12:35:27,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. 122.49/77.71 [2019-03-28 12:35:27,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 49. 122.49/77.71 [2019-03-28 12:35:27,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. 122.49/77.71 [2019-03-28 12:35:27,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 76 transitions. 122.49/77.71 [2019-03-28 12:35:27,439 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 76 transitions. Word has length 20 122.49/77.71 [2019-03-28 12:35:27,439 INFO L84 Accepts]: Finished accepts. word is rejected. 122.49/77.71 [2019-03-28 12:35:27,440 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 76 transitions. 122.49/77.71 [2019-03-28 12:35:27,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. 122.49/77.71 [2019-03-28 12:35:27,440 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 76 transitions. 122.49/77.71 [2019-03-28 12:35:27,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 122.49/77.71 [2019-03-28 12:35:27,440 INFO L394 BasicCegarLoop]: Found error trace 122.49/77.71 [2019-03-28 12:35:27,441 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 122.49/77.71 [2019-03-28 12:35:27,441 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 122.49/77.71 [2019-03-28 12:35:27,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.49/77.71 [2019-03-28 12:35:27,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1405299192, now seen corresponding path program 1 times 122.49/77.71 [2019-03-28 12:35:27,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.49/77.71 [2019-03-28 12:35:27,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.49/77.71 [2019-03-28 12:35:27,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:35:27,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:35:27,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:35:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.71 [2019-03-28 12:35:27,681 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 122.49/77.71 [2019-03-28 12:35:27,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 122.49/77.71 [2019-03-28 12:35:27,682 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 122.49/77.71 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 122.49/77.71 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 122.49/77.71 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 122.49/77.71 [2019-03-28 12:35:27,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:35:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.71 [2019-03-28 12:35:27,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 36 conjunts are in the unsatisfiable core 122.49/77.71 [2019-03-28 12:35:27,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... 122.49/77.71 [2019-03-28 12:35:27,728 INFO L189 IndexEqualityManager]: detected not equals via solver 122.49/77.71 [2019-03-28 12:35:27,729 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 122.49/77.71 [2019-03-28 12:35:27,729 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:27,737 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:27,737 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:27,737 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:20 122.49/77.71 [2019-03-28 12:35:27,766 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 122.49/77.71 [2019-03-28 12:35:27,766 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:27,773 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:27,773 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:27,773 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 122.49/77.71 [2019-03-28 12:35:27,802 INFO L189 IndexEqualityManager]: detected not equals via solver 122.49/77.71 [2019-03-28 12:35:27,803 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 122.49/77.71 [2019-03-28 12:35:27,803 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:27,812 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:27,813 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:27,814 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 122.49/77.71 [2019-03-28 12:35:27,902 INFO L189 IndexEqualityManager]: detected not equals via solver 122.49/77.71 [2019-03-28 12:35:27,907 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:27,908 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 122.49/77.71 [2019-03-28 12:35:27,909 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 122.49/77.71 [2019-03-28 12:35:27,919 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:27,920 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:27,920 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:27 122.49/77.71 [2019-03-28 12:35:28,047 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 122.49/77.71 [2019-03-28 12:35:28,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 122.49/77.71 [2019-03-28 12:35:28,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 122.49/77.71 [2019-03-28 12:35:28,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states 122.49/77.71 [2019-03-28 12:35:28,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. 122.49/77.71 [2019-03-28 12:35:28,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 122.49/77.71 [2019-03-28 12:35:28,088 INFO L87 Difference]: Start difference. First operand 49 states and 76 transitions. Second operand 20 states. 122.49/77.71 [2019-03-28 12:35:29,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 122.49/77.71 [2019-03-28 12:35:29,988 INFO L93 Difference]: Finished difference Result 103 states and 158 transitions. 122.49/77.71 [2019-03-28 12:35:29,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. 122.49/77.71 [2019-03-28 12:35:29,989 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 122.49/77.71 [2019-03-28 12:35:29,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 122.49/77.71 [2019-03-28 12:35:29,990 INFO L225 Difference]: With dead ends: 103 122.49/77.71 [2019-03-28 12:35:29,990 INFO L226 Difference]: Without dead ends: 54 122.49/77.71 [2019-03-28 12:35:29,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=328, Invalid=1564, Unknown=0, NotChecked=0, Total=1892 122.49/77.71 [2019-03-28 12:35:29,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. 122.49/77.71 [2019-03-28 12:35:29,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 27. 122.49/77.71 [2019-03-28 12:35:29,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 122.49/77.71 [2019-03-28 12:35:29,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. 122.49/77.71 [2019-03-28 12:35:29,998 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 39 transitions. Word has length 20 122.49/77.71 [2019-03-28 12:35:29,998 INFO L84 Accepts]: Finished accepts. word is rejected. 122.49/77.71 [2019-03-28 12:35:29,998 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 39 transitions. 122.49/77.71 [2019-03-28 12:35:29,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. 122.49/77.71 [2019-03-28 12:35:29,998 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. 122.49/77.71 [2019-03-28 12:35:29,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 122.49/77.71 [2019-03-28 12:35:29,999 INFO L394 BasicCegarLoop]: Found error trace 122.49/77.71 [2019-03-28 12:35:29,999 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] 122.49/77.71 [2019-03-28 12:35:29,999 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 122.49/77.71 [2019-03-28 12:35:29,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.49/77.71 [2019-03-28 12:35:30,000 INFO L82 PathProgramCache]: Analyzing trace with hash 174520754, now seen corresponding path program 1 times 122.49/77.71 [2019-03-28 12:35:30,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.49/77.71 [2019-03-28 12:35:30,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.49/77.71 [2019-03-28 12:35:30,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:35:30,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:35:30,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:35:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.71 [2019-03-28 12:35:30,156 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. 122.49/77.71 [2019-03-28 12:35:30,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 122.49/77.71 [2019-03-28 12:35:30,156 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 122.49/77.71 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 122.49/77.71 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 122.49/77.71 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 122.49/77.71 [2019-03-28 12:35:30,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:35:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.71 [2019-03-28 12:35:30,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 40 conjunts are in the unsatisfiable core 122.49/77.71 [2019-03-28 12:35:30,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... 122.49/77.71 [2019-03-28 12:35:30,206 INFO L189 IndexEqualityManager]: detected not equals via solver 122.49/77.71 [2019-03-28 12:35:30,207 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 122.49/77.71 [2019-03-28 12:35:30,208 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:30,214 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:30,220 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 122.49/77.71 [2019-03-28 12:35:30,221 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:30,227 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:30,227 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:30,227 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 122.49/77.71 [2019-03-28 12:35:30,249 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 122.49/77.71 [2019-03-28 12:35:30,249 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:30,254 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:30,255 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:30,255 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 122.49/77.71 [2019-03-28 12:35:30,277 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 122.49/77.71 [2019-03-28 12:35:30,278 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:30,284 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:30,285 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:30,285 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 122.49/77.71 [2019-03-28 12:35:30,366 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:30,367 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 122.49/77.71 [2019-03-28 12:35:30,368 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 122.49/77.71 [2019-03-28 12:35:30,377 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:30,378 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 122.49/77.71 [2019-03-28 12:35:30,378 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:23 122.49/77.71 [2019-03-28 12:35:30,436 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. 122.49/77.71 [2019-03-28 12:35:30,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 122.49/77.71 [2019-03-28 12:35:30,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 122.49/77.71 [2019-03-28 12:35:30,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states 122.49/77.71 [2019-03-28 12:35:30,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. 122.49/77.71 [2019-03-28 12:35:30,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 122.49/77.71 [2019-03-28 12:35:30,465 INFO L87 Difference]: Start difference. First operand 27 states and 39 transitions. Second operand 17 states. 122.49/77.71 [2019-03-28 12:35:31,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 122.49/77.71 [2019-03-28 12:35:31,024 INFO L93 Difference]: Finished difference Result 55 states and 82 transitions. 122.49/77.71 [2019-03-28 12:35:31,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 122.49/77.71 [2019-03-28 12:35:31,024 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 122.49/77.71 [2019-03-28 12:35:31,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 122.49/77.71 [2019-03-28 12:35:31,025 INFO L225 Difference]: With dead ends: 55 122.49/77.71 [2019-03-28 12:35:31,025 INFO L226 Difference]: Without dead ends: 54 122.49/77.71 [2019-03-28 12:35:31,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 122.49/77.71 [2019-03-28 12:35:31,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. 122.49/77.71 [2019-03-28 12:35:31,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 28. 122.49/77.71 [2019-03-28 12:35:31,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 122.49/77.71 [2019-03-28 12:35:31,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. 122.49/77.71 [2019-03-28 12:35:31,032 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 42 transitions. Word has length 26 122.49/77.71 [2019-03-28 12:35:31,033 INFO L84 Accepts]: Finished accepts. word is rejected. 122.49/77.71 [2019-03-28 12:35:31,033 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 42 transitions. 122.49/77.71 [2019-03-28 12:35:31,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. 122.49/77.71 [2019-03-28 12:35:31,033 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 42 transitions. 122.49/77.71 [2019-03-28 12:35:31,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 122.49/77.71 [2019-03-28 12:35:31,033 INFO L394 BasicCegarLoop]: Found error trace 122.49/77.71 [2019-03-28 12:35:31,034 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] 122.49/77.71 [2019-03-28 12:35:31,034 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 122.49/77.71 [2019-03-28 12:35:31,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.49/77.71 [2019-03-28 12:35:31,034 INFO L82 PathProgramCache]: Analyzing trace with hash 174550545, now seen corresponding path program 1 times 122.49/77.71 [2019-03-28 12:35:31,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.49/77.71 [2019-03-28 12:35:31,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.49/77.71 [2019-03-28 12:35:31,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:35:31,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:35:31,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:35:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.71 [2019-03-28 12:35:31,179 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. 122.49/77.71 [2019-03-28 12:35:31,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 122.49/77.71 [2019-03-28 12:35:31,179 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 122.49/77.71 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 122.49/77.71 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 122.49/77.71 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 122.49/77.71 [2019-03-28 12:35:31,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:35:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.71 [2019-03-28 12:35:31,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 40 conjunts are in the unsatisfiable core 122.49/77.71 [2019-03-28 12:35:31,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... 122.49/77.71 [2019-03-28 12:35:31,228 INFO L189 IndexEqualityManager]: detected not equals via solver 122.49/77.71 [2019-03-28 12:35:31,228 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 122.49/77.71 [2019-03-28 12:35:31,229 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:31,235 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:31,239 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 122.49/77.71 [2019-03-28 12:35:31,239 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:31,245 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:31,245 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:31,246 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 122.49/77.71 [2019-03-28 12:35:31,267 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 122.49/77.71 [2019-03-28 12:35:31,267 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:31,273 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:31,273 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:31,273 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 122.49/77.71 [2019-03-28 12:35:31,297 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 122.49/77.71 [2019-03-28 12:35:31,298 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:31,304 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:31,305 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 122.49/77.71 [2019-03-28 12:35:31,305 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 122.49/77.71 [2019-03-28 12:35:31,414 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:31,414 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 122.49/77.71 [2019-03-28 12:35:31,415 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 122.49/77.71 [2019-03-28 12:35:31,433 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 122.49/77.71 [2019-03-28 12:35:31,435 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 122.49/77.71 [2019-03-28 12:35:31,435 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:23 122.49/77.71 [2019-03-28 12:35:31,497 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. 122.49/77.71 [2019-03-28 12:35:31,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 122.49/77.71 [2019-03-28 12:35:31,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 122.49/77.71 [2019-03-28 12:35:31,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states 122.49/77.71 [2019-03-28 12:35:31,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. 122.49/77.71 [2019-03-28 12:35:31,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 122.49/77.71 [2019-03-28 12:35:31,527 INFO L87 Difference]: Start difference. First operand 28 states and 42 transitions. Second operand 17 states. 122.49/77.71 [2019-03-28 12:35:32,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 122.49/77.71 [2019-03-28 12:35:32,059 INFO L93 Difference]: Finished difference Result 53 states and 82 transitions. 122.49/77.71 [2019-03-28 12:35:32,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 122.49/77.71 [2019-03-28 12:35:32,060 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 122.49/77.71 [2019-03-28 12:35:32,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 122.49/77.71 [2019-03-28 12:35:32,060 INFO L225 Difference]: With dead ends: 53 122.49/77.71 [2019-03-28 12:35:32,060 INFO L226 Difference]: Without dead ends: 0 122.49/77.71 [2019-03-28 12:35:32,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 122.49/77.71 [2019-03-28 12:35:32,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 122.49/77.71 [2019-03-28 12:35:32,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 122.49/77.71 [2019-03-28 12:35:32,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 122.49/77.71 [2019-03-28 12:35:32,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 122.49/77.71 [2019-03-28 12:35:32,062 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 122.49/77.71 [2019-03-28 12:35:32,062 INFO L84 Accepts]: Finished accepts. word is rejected. 122.49/77.71 [2019-03-28 12:35:32,062 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 122.49/77.71 [2019-03-28 12:35:32,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. 122.49/77.71 [2019-03-28 12:35:32,062 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 122.49/77.71 [2019-03-28 12:35:32,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 122.49/77.71 [2019-03-28 12:35:32,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 122.49/77.71 [2019-03-28 12:35:32,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 122.49/77.71 [2019-03-28 12:35:32,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 122.49/77.71 [2019-03-28 12:35:32,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 122.49/77.71 [2019-03-28 12:35:32,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 122.49/77.71 [2019-03-28 12:35:33,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 122.49/77.71 [2019-03-28 12:35:33,186 WARN L188 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 358 DAG size of output: 321 122.49/77.71 [2019-03-28 12:35:33,440 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 248 DAG size of output: 233 122.49/77.71 [2019-03-28 12:36:13,143 WARN L188 SmtUtils]: Spent 39.70 s on a formula simplification. DAG size of input: 317 DAG size of output: 116 122.49/77.71 [2019-03-28 12:36:15,728 WARN L188 SmtUtils]: Spent 2.58 s on a formula simplification. DAG size of input: 231 DAG size of output: 107 122.49/77.71 [2019-03-28 12:36:15,731 INFO L448 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. 122.49/77.71 [2019-03-28 12:36:15,731 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 45) no Hoare annotation was computed. 122.49/77.71 [2019-03-28 12:36:15,731 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 44) no Hoare annotation was computed. 122.49/77.71 [2019-03-28 12:36:15,731 INFO L448 ceAbstractionStarter]: For program point L25-1(lines 25 28) no Hoare annotation was computed. 122.49/77.71 [2019-03-28 12:36:15,731 INFO L448 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. 122.49/77.71 [2019-03-28 12:36:15,732 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. 122.49/77.71 [2019-03-28 12:36:15,732 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC(line 27) no Hoare annotation was computed. 122.49/77.71 [2019-03-28 12:36:15,732 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 45) no Hoare annotation was computed. 122.49/77.71 [2019-03-28 12:36:15,733 INFO L444 ceAbstractionStarter]: At program point L25-3(lines 25 28) the Hoare annotation is: (let ((.cse28 (select |#length| ULTIMATE.start_main_~nondetString1~0.base)) (.cse29 (select |#length| ULTIMATE.start_cstrcspn_~s2.base)) (.cse30 (select |#length| ULTIMATE.start_cstrcspn_~spanp~0.base))) (let ((.cse6 (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~nondetString2~0.base (store (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)) 0)) ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~nondetString1~0.offset))) (.cse13 (<= (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0) 1)) (.cse0 (<= 1 .cse30)) (.cse26 (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) (+ .cse29 (- 1))) 0)) (.cse22 (= 0 ULTIMATE.start_cstrcspn_~spanp~0.offset)) (.cse23 (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~spanp~0.base) (+ .cse30 (- 1))) 0)) (.cse24 (<= (+ ULTIMATE.start_cstrcspn_~spanp~0.offset 1) .cse30)) (.cse1 (exists ((ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_cstrcspn_~s2.offset ULTIMATE.start_main_~nondetString2~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) (+ (select |#length| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_main_~nondetString2~0.offset (- 1))) 0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0)))) (.cse25 (<= 1 ULTIMATE.start_cstrcspn_~spanp~0.offset)) (.cse2 (= ULTIMATE.start_main_~length1~0 .cse28)) (.cse4 (<= 1 ULTIMATE.start_cstrcspn_~p~0.offset)) (.cse5 (<= ULTIMATE.start_cstrcspn_~p~0.base ULTIMATE.start_cstrcspn_~s1.base)) (.cse7 (= (select |#valid| ULTIMATE.start_cstrcspn_~p~0.base) 1)) (.cse8 (<= ULTIMATE.start_cstrcspn_~s1.base ULTIMATE.start_cstrcspn_~p~0.base)) (.cse9 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse10 (<= 1 .cse29)) (.cse11 (= 0 ULTIMATE.start_cstrcspn_~s2.offset)) (.cse14 (<= 1 ULTIMATE.start_main_~length1~0)) (.cse15 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse17 (= 1 (select |#valid| ULTIMATE.start_cstrcspn_~spanp~0.base))) (.cse19 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base))) (.cse20 (= (select |#valid| ULTIMATE.start_cstrcspn_~s2.base) 1)) (.cse18 (= ULTIMATE.start_main_~nondetString2~0.offset 0)) (.cse16 (= ULTIMATE.start_main_~nondetString1~0.offset 0)) (.cse3 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse12 (= ULTIMATE.start_cstrcspn_~c~0 0)) (.cse21 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (exists ((ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~spanp~0.base) (+ (select |#length| ULTIMATE.start_cstrcspn_~spanp~0.base) ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (<= ULTIMATE.start_cstrcspn_~spanp~0.offset ULTIMATE.start_main_~nondetString2~0.offset) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))) .cse19 .cse20) .cse21 .cse22) (and .cse23 .cse24 (and .cse25 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse13 .cse15 .cse16 .cse18 .cse17 .cse19 .cse20) .cse26 .cse21) (let ((.cse27 (select |#length| ULTIMATE.start_cstrcspn_~p~0.base))) (and (and (and (or (and (and .cse0 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse19 .cse20) .cse23 .cse26 .cse18 .cse22) (and .cse23 .cse24 (and .cse1 .cse25 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse19 .cse20) .cse18)) .cse16 .cse3) (<= ULTIMATE.start_cstrcspn_~p~0.offset .cse27) (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (not (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrcspn_~p~0.base)))) (or .cse12 (<= (+ ULTIMATE.start_cstrcspn_~p~0.offset 1) .cse27))) (= (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ .cse28 (- 1))) 0) .cse21 (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~p~0.base) (+ .cse27 (- 1))))))))) 122.49/77.71 [2019-03-28 12:36:15,733 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. 122.49/77.71 [2019-03-28 12:36:15,733 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. 122.49/77.71 [2019-03-28 12:36:15,733 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. 122.49/77.71 [2019-03-28 12:36:15,733 INFO L448 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. 122.49/77.71 [2019-03-28 12:36:15,733 INFO L448 ceAbstractionStarter]: For program point L44-1(line 44) no Hoare annotation was computed. 122.49/77.71 [2019-03-28 12:36:15,733 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 44) no Hoare annotation was computed. 122.49/77.71 [2019-03-28 12:36:15,733 INFO L448 ceAbstractionStarter]: For program point L36(lines 36 38) no Hoare annotation was computed. 122.49/77.71 [2019-03-28 12:36:15,733 INFO L448 ceAbstractionStarter]: For program point L36-2(lines 33 47) no Hoare annotation was computed. 122.49/77.71 [2019-03-28 12:36:15,734 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 122.49/77.71 [2019-03-28 12:36:15,734 INFO L448 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. 122.49/77.71 [2019-03-28 12:36:15,734 INFO L448 ceAbstractionStarter]: For program point L26-2(lines 26 27) no Hoare annotation was computed. 122.49/77.71 [2019-03-28 12:36:15,734 INFO L444 ceAbstractionStarter]: At program point L22-2(lines 22 29) the Hoare annotation is: (let ((.cse21 (select |#memory_int| ULTIMATE.start_cstrcspn_~p~0.base)) (.cse24 (select |#length| ULTIMATE.start_cstrcspn_~p~0.base)) (.cse23 (select |#length| ULTIMATE.start_main_~nondetString1~0.base))) (let ((.cse13 (= 0 ULTIMATE.start_cstrcspn_~s2.offset)) (.cse4 (= ULTIMATE.start_main_~nondetString1~0.offset 0)) (.cse0 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse16 (= ULTIMATE.start_main_~nondetString2~0.offset 0)) (.cse1 (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (not (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrcspn_~p~0.base))))) (.cse19 (= (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ .cse23 (- 1))) 0)) (.cse8 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)) (.cse20 (= 0 (select .cse21 (+ .cse24 (- 1))))) (.cse22 (= 0 ULTIMATE.start_cstrcspn_~p~0.offset)) (.cse2 (<= (+ ULTIMATE.start_cstrcspn_~p~0.offset 1) .cse24)) (.cse5 (exists ((ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_cstrcspn_~s2.offset ULTIMATE.start_main_~nondetString2~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) (+ (select |#length| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_main_~nondetString2~0.offset (- 1))) 0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0)))) (.cse6 (= ULTIMATE.start_main_~length1~0 .cse23)) (.cse7 (<= ULTIMATE.start_cstrcspn_~p~0.base ULTIMATE.start_cstrcspn_~s1.base)) (.cse9 (= (select |#valid| ULTIMATE.start_cstrcspn_~p~0.base) 1)) (.cse10 (<= ULTIMATE.start_cstrcspn_~s1.base ULTIMATE.start_cstrcspn_~p~0.base)) (.cse11 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse12 (<= 1 (select |#length| ULTIMATE.start_cstrcspn_~s2.base))) (.cse14 (<= 1 ULTIMATE.start_main_~length1~0)) (.cse15 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse17 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base))) (.cse18 (= (select |#valid| ULTIMATE.start_cstrcspn_~s2.base) 1))) (or (and .cse0 .cse1 (and .cse2 (let ((.cse3 (select |#length| ULTIMATE.start_cstrcspn_~spanp~0.base))) (and (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~spanp~0.base) (+ .cse3 (- 1))) 0) (and .cse4 (and .cse5 (<= 1 ULTIMATE.start_cstrcspn_~spanp~0.offset) .cse6 (<= 1 ULTIMATE.start_cstrcspn_~p~0.offset) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= 1 (select |#valid| ULTIMATE.start_cstrcspn_~spanp~0.base)) (or (<= (+ ULTIMATE.start_cstrcspn_~spanp~0.offset 1) .cse3) (= ULTIMATE.start_cstrcspn_~sc~0 0)) .cse17 .cse18)) (<= ULTIMATE.start_cstrcspn_~spanp~0.offset .cse3)))) .cse19 .cse20) (and (and (and (= (select .cse21 ULTIMATE.start_cstrcspn_~p~0.offset) 0) .cse2 .cse5 .cse6 .cse0 .cse7 (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~nondetString2~0.base (store (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)) 0)) ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~nondetString1~0.offset)) .cse9 .cse10 .cse11 .cse12 .cse13 (<= (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0) 1) .cse14 .cse15 .cse16 .cse17 .cse18) .cse22 .cse4) .cse8) (and .cse13 .cse4 .cse0 .cse16 .cse1 .cse19 .cse8 .cse20 (and .cse22 (and .cse2 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse17 .cse18)))))) 122.49/77.71 [2019-03-28 12:36:15,734 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 39 41) no Hoare annotation was computed. 122.49/77.71 [2019-03-28 12:36:15,735 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 122.49/77.71 [2019-03-28 12:36:15,744 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,745 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,746 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,747 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,747 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,747 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,749 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,749 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,749 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,750 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,750 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,751 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,751 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,756 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,757 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,757 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,757 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,758 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,758 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,758 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,759 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,759 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,759 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,760 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,760 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,760 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,760 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,761 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,761 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,761 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,762 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,762 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,762 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,762 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,763 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,763 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,763 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,764 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,764 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,764 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,765 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,765 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,765 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,765 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,766 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,766 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,767 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,767 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,767 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,767 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,768 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,768 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,768 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,768 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,769 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,769 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,778 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,779 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,779 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,780 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,780 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,780 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,786 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,787 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,787 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,788 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,788 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,788 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,789 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,789 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,789 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,789 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,790 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,790 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,790 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,790 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,791 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,791 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,791 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,792 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,792 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,792 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,792 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,793 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,793 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,793 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,794 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,794 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,794 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,796 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,796 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,796 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,797 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,797 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,797 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,797 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,798 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,798 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,798 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,798 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,798 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,801 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,802 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,802 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,802 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,802 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,803 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,803 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,805 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,806 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,806 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,806 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,806 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,807 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,807 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,807 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,809 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,809 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,809 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,810 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,810 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,810 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,811 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,811 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,811 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,812 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,812 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,812 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,812 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,813 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,813 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,813 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,813 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,814 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,814 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,814 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,815 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,815 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,815 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,816 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,816 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,816 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,816 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,817 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,817 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,817 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,817 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,817 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,818 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,818 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,818 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,819 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,819 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,820 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,820 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,820 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,822 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,822 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,823 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,823 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,823 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,824 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,824 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,824 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,824 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,825 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,825 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.49/77.71 [2019-03-28 12:36:15,826 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,827 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,827 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,827 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,827 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,829 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,829 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,829 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,829 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,830 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,830 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,830 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,830 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,830 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,831 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,831 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,831 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,832 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,832 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,832 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,833 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,833 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,833 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,833 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,834 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,834 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,834 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,834 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,835 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,835 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,835 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.49/77.71 [2019-03-28 12:36:15,835 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,836 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,836 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:15,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:36:15 BasicIcfg 122.49/77.71 [2019-03-28 12:36:15,838 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 122.49/77.71 [2019-03-28 12:36:15,839 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 122.49/77.71 [2019-03-28 12:36:15,839 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 122.49/77.71 [2019-03-28 12:36:15,843 INFO L276 PluginConnector]: BuchiAutomizer initialized 122.49/77.71 [2019-03-28 12:36:15,843 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 122.49/77.71 [2019-03-28 12:36:15,844 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:35:13" (1/5) ... 122.49/77.71 [2019-03-28 12:36:15,844 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ed31e01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:36:15, skipping insertion in model container 122.49/77.71 [2019-03-28 12:36:15,844 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 122.49/77.71 [2019-03-28 12:36:15,844 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:13" (2/5) ... 122.49/77.71 [2019-03-28 12:36:15,845 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ed31e01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:36:15, skipping insertion in model container 122.49/77.71 [2019-03-28 12:36:15,845 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 122.49/77.71 [2019-03-28 12:36:15,845 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:35:13" (3/5) ... 122.49/77.71 [2019-03-28 12:36:15,845 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ed31e01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:36:15, skipping insertion in model container 122.49/77.71 [2019-03-28 12:36:15,845 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 122.49/77.71 [2019-03-28 12:36:15,845 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:35:13" (4/5) ... 122.49/77.71 [2019-03-28 12:36:15,846 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ed31e01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:36:15, skipping insertion in model container 122.49/77.71 [2019-03-28 12:36:15,846 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 122.49/77.71 [2019-03-28 12:36:15,846 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:36:15" (5/5) ... 122.49/77.71 [2019-03-28 12:36:15,847 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 122.49/77.71 [2019-03-28 12:36:15,869 INFO L133 ementStrategyFactory]: Using default assertion order modulation 122.49/77.71 [2019-03-28 12:36:15,869 INFO L374 BuchiCegarLoop]: Interprodecural is true 122.49/77.71 [2019-03-28 12:36:15,869 INFO L375 BuchiCegarLoop]: Hoare is true 122.49/77.71 [2019-03-28 12:36:15,869 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 122.49/77.71 [2019-03-28 12:36:15,869 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 122.49/77.71 [2019-03-28 12:36:15,869 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 122.49/77.71 [2019-03-28 12:36:15,869 INFO L379 BuchiCegarLoop]: Difference is false 122.49/77.71 [2019-03-28 12:36:15,870 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 122.49/77.71 [2019-03-28 12:36:15,870 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 122.49/77.71 [2019-03-28 12:36:15,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. 122.49/77.71 [2019-03-28 12:36:15,877 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 122.49/77.71 [2019-03-28 12:36:15,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 122.49/77.71 [2019-03-28 12:36:15,878 INFO L119 BuchiIsEmpty]: Starting construction of run 122.49/77.71 [2019-03-28 12:36:15,882 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 122.49/77.71 [2019-03-28 12:36:15,882 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 122.49/77.71 [2019-03-28 12:36:15,882 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 122.49/77.71 [2019-03-28 12:36:15,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. 122.49/77.71 [2019-03-28 12:36:15,883 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 122.49/77.71 [2019-03-28 12:36:15,883 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 122.49/77.71 [2019-03-28 12:36:15,884 INFO L119 BuchiIsEmpty]: Starting construction of run 122.49/77.71 [2019-03-28 12:36:15,884 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 122.49/77.71 [2019-03-28 12:36:15,884 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 122.49/77.71 [2019-03-28 12:36:15,889 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue [150] ULTIMATE.startENTRY-->L36: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~ret8=|v_ULTIMATE.start_main_#t~ret8_4|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~ret8, ULTIMATE.start_main_~length2~0] 23#L36true [102] L36-->L36-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 19#L36-2true [79] L36-2-->L39-1: Formula: (and (< v_ULTIMATE.start_main_~length2~0_5 1) (= v_ULTIMATE.start_main_~length2~0_4 1)) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_5} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length2~0] 7#L39-1true [121] L39-1-->L44: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc6.base_2| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc6.base_2| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc6.base_2|)) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc6.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc7.base_2| v_ULTIMATE.start_main_~length2~0_7)) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_2|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_2|, #valid=|v_#valid_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc7.offset] 17#L44true [95] L44-->L44-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 13#L44-1true [151] L44-1-->L22-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= v_ULTIMATE.start_cstrcspn_~s1.offset_4 |v_ULTIMATE.start_cstrcspn_#in~s1.offset_2|) (= v_ULTIMATE.start_cstrcspn_~s1.base_5 v_ULTIMATE.start_cstrcspn_~p~0.base_8) (= |v_ULTIMATE.start_cstrcspn_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= |v_ULTIMATE.start_cstrcspn_#in~s1.base_2| v_ULTIMATE.start_cstrcspn_~s1.base_5) (= |v_ULTIMATE.start_cstrcspn_#in~s2.offset_2| v_ULTIMATE.start_cstrcspn_~s2.offset_4) (= |v_ULTIMATE.start_cstrcspn_#in~s2.base_2| v_ULTIMATE.start_cstrcspn_~s2.base_4) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrcspn_#in~s1.offset_2|) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0))) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_cstrcspn_~s1.offset_4 v_ULTIMATE.start_cstrcspn_~p~0.offset_7) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrcspn_#in~s2.offset_2|) (= |v_ULTIMATE.start_cstrcspn_#in~s2.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_8|, ULTIMATE.start_cstrcspn_#t~post0.base=|v_ULTIMATE.start_cstrcspn_#t~post0.base_7|, ULTIMATE.start_cstrcspn_~s1.offset=v_ULTIMATE.start_cstrcspn_~s1.offset_4, ULTIMATE.start_cstrcspn_~s2.offset=v_ULTIMATE.start_cstrcspn_~s2.offset_4, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrcspn_#t~post0.offset=|v_ULTIMATE.start_cstrcspn_#t~post0.offset_6|, ULTIMATE.start_cstrcspn_#in~s2.base=|v_ULTIMATE.start_cstrcspn_#in~s2.base_2|, ULTIMATE.start_cstrcspn_#in~s1.base=|v_ULTIMATE.start_cstrcspn_#in~s1.base_2|, #length=|v_#length_12|, ULTIMATE.start_cstrcspn_#in~s1.offset=|v_ULTIMATE.start_cstrcspn_#in~s1.offset_2|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_8, ULTIMATE.start_cstrcspn_~spanp~0.offset=v_ULTIMATE.start_cstrcspn_~spanp~0.offset_6, ULTIMATE.start_cstrcspn_~s1.base=v_ULTIMATE.start_cstrcspn_~s1.base_5, ULTIMATE.start_cstrcspn_~s2.base=v_ULTIMATE.start_cstrcspn_~s2.base_4, ULTIMATE.start_cstrcspn_~spanp~0.base=v_ULTIMATE.start_cstrcspn_~spanp~0.base_6, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_7|, ULTIMATE.start_cstrcspn_#t~mem3=|v_ULTIMATE.start_cstrcspn_#t~mem3_6|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrcspn_~p~0.offset=v_ULTIMATE.start_cstrcspn_~p~0.offset_7, ULTIMATE.start_cstrcspn_#t~mem1=|v_ULTIMATE.start_cstrcspn_#t~mem1_5|, ULTIMATE.start_cstrcspn_~p~0.base=v_ULTIMATE.start_cstrcspn_~p~0.base_8, ULTIMATE.start_cstrcspn_#in~s2.offset=|v_ULTIMATE.start_cstrcspn_#in~s2.offset_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrcspn_#res=|v_ULTIMATE.start_cstrcspn_#res_4|, ULTIMATE.start_cstrcspn_~c~0=v_ULTIMATE.start_cstrcspn_~c~0_6} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~post2.base, ULTIMATE.start_cstrcspn_~spanp~0.offset, ULTIMATE.start_cstrcspn_~s1.base, ULTIMATE.start_cstrcspn_~s2.base, ULTIMATE.start_cstrcspn_#t~post0.base, ULTIMATE.start_cstrcspn_~s1.offset, ULTIMATE.start_cstrcspn_~spanp~0.base, ULTIMATE.start_cstrcspn_#t~post2.offset, ULTIMATE.start_cstrcspn_#t~mem3, ULTIMATE.start_cstrcspn_~p~0.offset, ULTIMATE.start_cstrcspn_#t~mem1, ULTIMATE.start_cstrcspn_~p~0.base, ULTIMATE.start_cstrcspn_~s2.offset, ULTIMATE.start_cstrcspn_#in~s2.offset, ULTIMATE.start_cstrcspn_#t~post0.offset, #memory_int, ULTIMATE.start_cstrcspn_#in~s2.base, ULTIMATE.start_cstrcspn_#in~s1.base, ULTIMATE.start_cstrcspn_#in~s1.offset, ULTIMATE.start_cstrcspn_#res, ULTIMATE.start_cstrcspn_~c~0, ULTIMATE.start_cstrcspn_~sc~0] 10#L22-2true 122.49/77.71 [2019-03-28 12:36:15,890 INFO L796 eck$LassoCheckResult]: Loop: 10#L22-2true [70] L22-2-->L23: Formula: (and (= |v_ULTIMATE.start_cstrcspn_#t~post0.base_2| v_ULTIMATE.start_cstrcspn_~p~0.base_5) (= v_ULTIMATE.start_cstrcspn_~p~0.base_4 |v_ULTIMATE.start_cstrcspn_#t~post0.base_2|) (= |v_ULTIMATE.start_cstrcspn_#t~post0.offset_2| v_ULTIMATE.start_cstrcspn_~p~0.offset_5) (= v_ULTIMATE.start_cstrcspn_~p~0.offset_4 (+ |v_ULTIMATE.start_cstrcspn_#t~post0.offset_2| 1))) InVars {ULTIMATE.start_cstrcspn_~p~0.base=v_ULTIMATE.start_cstrcspn_~p~0.base_5, ULTIMATE.start_cstrcspn_~p~0.offset=v_ULTIMATE.start_cstrcspn_~p~0.offset_5} OutVars{ULTIMATE.start_cstrcspn_#t~post0.offset=|v_ULTIMATE.start_cstrcspn_#t~post0.offset_2|, ULTIMATE.start_cstrcspn_~p~0.base=v_ULTIMATE.start_cstrcspn_~p~0.base_4, ULTIMATE.start_cstrcspn_#t~post0.base=|v_ULTIMATE.start_cstrcspn_#t~post0.base_2|, ULTIMATE.start_cstrcspn_~p~0.offset=v_ULTIMATE.start_cstrcspn_~p~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_~p~0.base, ULTIMATE.start_cstrcspn_#t~post0.offset, ULTIMATE.start_cstrcspn_#t~post0.base, ULTIMATE.start_cstrcspn_~p~0.offset] 18#L23true [152] L23-->L25-3: Formula: (and (<= 0 |v_ULTIMATE.start_cstrcspn_#t~post0.offset_8|) (<= (+ |v_ULTIMATE.start_cstrcspn_#t~post0.offset_8| 1) (select |v_#length_13| |v_ULTIMATE.start_cstrcspn_#t~post0.base_9|)) (= 1 (select |v_#valid_20| |v_ULTIMATE.start_cstrcspn_#t~post0.base_9|)) (= v_ULTIMATE.start_cstrcspn_~s2.base_5 v_ULTIMATE.start_cstrcspn_~spanp~0.base_7) (= v_ULTIMATE.start_cstrcspn_~c~0_7 (select (select |v_#memory_int_9| |v_ULTIMATE.start_cstrcspn_#t~post0.base_9|) |v_ULTIMATE.start_cstrcspn_#t~post0.offset_8|)) (= v_ULTIMATE.start_cstrcspn_~spanp~0.offset_7 v_ULTIMATE.start_cstrcspn_~s2.offset_5)) InVars {ULTIMATE.start_cstrcspn_~s2.offset=v_ULTIMATE.start_cstrcspn_~s2.offset_5, #valid=|v_#valid_20|, ULTIMATE.start_cstrcspn_#t~post0.offset=|v_ULTIMATE.start_cstrcspn_#t~post0.offset_8|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrcspn_~s2.base=v_ULTIMATE.start_cstrcspn_~s2.base_5, #length=|v_#length_13|, ULTIMATE.start_cstrcspn_#t~post0.base=|v_ULTIMATE.start_cstrcspn_#t~post0.base_9|} OutVars{ULTIMATE.start_cstrcspn_~s2.offset=v_ULTIMATE.start_cstrcspn_~s2.offset_5, #valid=|v_#valid_20|, ULTIMATE.start_cstrcspn_~spanp~0.offset=v_ULTIMATE.start_cstrcspn_~spanp~0.offset_7, ULTIMATE.start_cstrcspn_#t~post0.offset=|v_ULTIMATE.start_cstrcspn_#t~post0.offset_7|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrcspn_~s2.base=v_ULTIMATE.start_cstrcspn_~s2.base_5, #length=|v_#length_13|, ULTIMATE.start_cstrcspn_#t~post0.base=|v_ULTIMATE.start_cstrcspn_#t~post0.base_8|, ULTIMATE.start_cstrcspn_~spanp~0.base=v_ULTIMATE.start_cstrcspn_~spanp~0.base_7, ULTIMATE.start_cstrcspn_~c~0=v_ULTIMATE.start_cstrcspn_~c~0_7, ULTIMATE.start_cstrcspn_#t~mem1=|v_ULTIMATE.start_cstrcspn_#t~mem1_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_~spanp~0.offset, ULTIMATE.start_cstrcspn_#t~post0.offset, ULTIMATE.start_cstrcspn_#t~post0.base, ULTIMATE.start_cstrcspn_~spanp~0.base, ULTIMATE.start_cstrcspn_~c~0, ULTIMATE.start_cstrcspn_#t~mem1] 15#L25-3true [73] L25-3-->L26: Formula: (and (= v_ULTIMATE.start_cstrcspn_~spanp~0.base_4 |v_ULTIMATE.start_cstrcspn_#t~post2.base_2|) (= v_ULTIMATE.start_cstrcspn_~spanp~0.offset_4 (+ |v_ULTIMATE.start_cstrcspn_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrcspn_#t~post2.offset_2| v_ULTIMATE.start_cstrcspn_~spanp~0.offset_5) (= |v_ULTIMATE.start_cstrcspn_#t~post2.base_2| v_ULTIMATE.start_cstrcspn_~spanp~0.base_5)) InVars {ULTIMATE.start_cstrcspn_~spanp~0.offset=v_ULTIMATE.start_cstrcspn_~spanp~0.offset_5, ULTIMATE.start_cstrcspn_~spanp~0.base=v_ULTIMATE.start_cstrcspn_~spanp~0.base_5} OutVars{ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_2|, ULTIMATE.start_cstrcspn_~spanp~0.offset=v_ULTIMATE.start_cstrcspn_~spanp~0.offset_4, ULTIMATE.start_cstrcspn_~spanp~0.base=v_ULTIMATE.start_cstrcspn_~spanp~0.base_4, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~post2.base, ULTIMATE.start_cstrcspn_~spanp~0.offset, ULTIMATE.start_cstrcspn_~spanp~0.base, ULTIMATE.start_cstrcspn_#t~post2.offset] 4#L26true [153] L26-->L26-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrcspn_#t~post2.offset_8|) (<= (+ |v_ULTIMATE.start_cstrcspn_#t~post2.offset_8| 1) (select |v_#length_14| |v_ULTIMATE.start_cstrcspn_#t~post2.base_9|)) (= v_ULTIMATE.start_cstrcspn_~sc~0_9 |v_ULTIMATE.start_cstrcspn_#t~mem3_7|) (= (select |v_#valid_21| |v_ULTIMATE.start_cstrcspn_#t~post2.base_9|) 1) (= |v_ULTIMATE.start_cstrcspn_#t~mem3_7| (select (select |v_#memory_int_10| |v_ULTIMATE.start_cstrcspn_#t~post2.base_9|) |v_ULTIMATE.start_cstrcspn_#t~post2.offset_8|))) InVars {ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_8|} OutVars{ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ULTIMATE.start_cstrcspn_#t~mem3=|v_ULTIMATE.start_cstrcspn_#t~mem3_7|, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_8|, ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_9} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~mem3, ULTIMATE.start_cstrcspn_~sc~0] 20#L26-2true [140] L26-2-->L25-1: Formula: (> v_ULTIMATE.start_cstrcspn_~sc~0_5 v_ULTIMATE.start_cstrcspn_~c~0_5) InVars {ULTIMATE.start_cstrcspn_~c~0=v_ULTIMATE.start_cstrcspn_~c~0_5, ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_5} OutVars{ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_7|, ULTIMATE.start_cstrcspn_~c~0=v_ULTIMATE.start_cstrcspn_~c~0_5, ULTIMATE.start_cstrcspn_#t~mem3=|v_ULTIMATE.start_cstrcspn_#t~mem3_5|, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_6|, ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~post2.base, ULTIMATE.start_cstrcspn_#t~mem3, ULTIMATE.start_cstrcspn_#t~post2.offset] 21#L25-1true [82] L25-1-->L22-2: Formula: (= v_ULTIMATE.start_cstrcspn_~sc~0_6 0) InVars {ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_6} OutVars{ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_6} AuxVars[] AssignedVars[] 10#L22-2true 122.49/77.71 [2019-03-28 12:36:15,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.49/77.71 [2019-03-28 12:36:15,890 INFO L82 PathProgramCache]: Analyzing trace with hash 983581043, now seen corresponding path program 1 times 122.49/77.71 [2019-03-28 12:36:15,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.49/77.71 [2019-03-28 12:36:15,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.49/77.71 [2019-03-28 12:36:15,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:36:15,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:36:15,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:36:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 122.49/77.71 [2019-03-28 12:36:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 122.49/77.71 [2019-03-28 12:36:15,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.49/77.71 [2019-03-28 12:36:15,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1260721655, now seen corresponding path program 1 times 122.49/77.71 [2019-03-28 12:36:15,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.49/77.71 [2019-03-28 12:36:15,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.49/77.71 [2019-03-28 12:36:15,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:36:15,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:36:15,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:36:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 122.49/77.71 [2019-03-28 12:36:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 122.49/77.71 [2019-03-28 12:36:15,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.49/77.71 [2019-03-28 12:36:15,927 INFO L82 PathProgramCache]: Analyzing trace with hash 2064436731, now seen corresponding path program 1 times 122.49/77.71 [2019-03-28 12:36:15,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.49/77.71 [2019-03-28 12:36:15,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.49/77.71 [2019-03-28 12:36:15,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:36:15,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:36:15,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.49/77.71 [2019-03-28 12:36:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 122.49/77.71 [2019-03-28 12:36:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 122.49/77.71 [2019-03-28 12:36:16,293 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 122.49/77.71 [2019-03-28 12:36:16,395 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 77 122.49/77.71 [2019-03-28 12:36:16,406 INFO L216 LassoAnalysis]: Preferences: 122.49/77.71 [2019-03-28 12:36:16,407 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 122.49/77.71 [2019-03-28 12:36:16,407 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 122.49/77.71 [2019-03-28 12:36:16,408 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 122.49/77.71 [2019-03-28 12:36:16,408 INFO L127 ssoRankerPreferences]: Use exernal solver: false 122.49/77.71 [2019-03-28 12:36:16,408 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 122.49/77.71 [2019-03-28 12:36:16,408 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 122.49/77.71 [2019-03-28 12:36:16,408 INFO L130 ssoRankerPreferences]: Path of dumped script: 122.49/77.71 [2019-03-28 12:36:16,408 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 122.49/77.71 [2019-03-28 12:36:16,408 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 122.49/77.71 [2019-03-28 12:36:16,409 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 122.49/77.71 [2019-03-28 12:36:16,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.49/77.71 [2019-03-28 12:36:16,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.49/77.71 [2019-03-28 12:36:16,705 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 122.49/77.71 [2019-03-28 12:36:16,832 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 122.49/77.71 [2019-03-28 12:36:16,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.49/77.71 [2019-03-28 12:36:16,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.49/77.71 [2019-03-28 12:36:16,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.49/77.71 [2019-03-28 12:36:16,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.49/77.71 [2019-03-28 12:36:16,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.49/77.71 [2019-03-28 12:36:16,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.49/77.71 [2019-03-28 12:36:16,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.49/77.71 [2019-03-28 12:36:16,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.49/77.71 [2019-03-28 12:36:16,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.49/77.71 [2019-03-28 12:36:16,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.49/77.71 [2019-03-28 12:36:16,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.49/77.71 [2019-03-28 12:36:16,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.49/77.71 [2019-03-28 12:36:17,263 INFO L300 LassoAnalysis]: Preprocessing complete. 122.49/77.71 [2019-03-28 12:36:17,268 INFO L497 LassoAnalysis]: Using template 'affine'. 122.49/77.71 [2019-03-28 12:36:17,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.49/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.49/77.71 Number of strict supporting invariants: 0 122.49/77.71 Number of non-strict supporting invariants: 1 122.49/77.71 Consider only non-deceasing supporting invariants: true 122.49/77.71 Simplify termination arguments: true 122.49/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.49/77.71 [2019-03-28 12:36:17,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.49/77.71 [2019-03-28 12:36:17,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.49/77.71 [2019-03-28 12:36:17,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.49/77.71 [2019-03-28 12:36:17,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.49/77.71 [2019-03-28 12:36:17,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.49/77.71 [2019-03-28 12:36:17,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 122.49/77.71 [2019-03-28 12:36:17,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.49/77.71 [2019-03-28 12:36:17,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.49/77.71 [2019-03-28 12:36:17,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.49/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.49/77.71 Number of strict supporting invariants: 0 122.49/77.71 Number of non-strict supporting invariants: 1 122.49/77.71 Consider only non-deceasing supporting invariants: true 122.49/77.71 Simplify termination arguments: true 122.49/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.49/77.71 [2019-03-28 12:36:17,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.49/77.71 [2019-03-28 12:36:17,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.49/77.71 [2019-03-28 12:36:17,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.49/77.71 [2019-03-28 12:36:17,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.49/77.71 [2019-03-28 12:36:17,281 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.49/77.71 [2019-03-28 12:36:17,281 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 122.49/77.71 [2019-03-28 12:36:17,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.49/77.71 [2019-03-28 12:36:17,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.49/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.49/77.71 Number of strict supporting invariants: 0 122.49/77.71 Number of non-strict supporting invariants: 1 122.49/77.71 Consider only non-deceasing supporting invariants: true 122.49/77.71 Simplify termination arguments: true 122.49/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.49/77.71 [2019-03-28 12:36:17,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.49/77.71 [2019-03-28 12:36:17,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.49/77.71 [2019-03-28 12:36:17,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.49/77.71 [2019-03-28 12:36:17,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.49/77.71 [2019-03-28 12:36:17,287 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.49/77.71 [2019-03-28 12:36:17,287 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 122.49/77.71 [2019-03-28 12:36:17,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.49/77.71 [2019-03-28 12:36:17,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.49/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.49/77.71 Number of strict supporting invariants: 0 122.49/77.71 Number of non-strict supporting invariants: 1 122.49/77.71 Consider only non-deceasing supporting invariants: true 122.49/77.71 Simplify termination arguments: true 122.49/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.49/77.71 [2019-03-28 12:36:17,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.49/77.71 [2019-03-28 12:36:17,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.49/77.71 [2019-03-28 12:36:17,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.49/77.71 [2019-03-28 12:36:17,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.49/77.71 [2019-03-28 12:36:17,299 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.49/77.71 [2019-03-28 12:36:17,299 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 122.49/77.71 [2019-03-28 12:36:17,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.49/77.71 [2019-03-28 12:36:17,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.49/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.49/77.71 Number of strict supporting invariants: 0 122.49/77.71 Number of non-strict supporting invariants: 1 122.49/77.71 Consider only non-deceasing supporting invariants: true 122.49/77.71 Simplify termination arguments: true 122.49/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.49/77.71 [2019-03-28 12:36:17,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.49/77.71 [2019-03-28 12:36:17,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.49/77.71 [2019-03-28 12:36:17,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.49/77.71 [2019-03-28 12:36:17,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.49/77.71 [2019-03-28 12:36:17,310 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.49/77.71 [2019-03-28 12:36:17,310 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 122.49/77.71 [2019-03-28 12:36:17,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.49/77.71 [2019-03-28 12:36:17,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.49/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.49/77.71 Number of strict supporting invariants: 0 122.49/77.71 Number of non-strict supporting invariants: 1 122.49/77.71 Consider only non-deceasing supporting invariants: true 122.49/77.71 Simplify termination arguments: true 122.49/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.49/77.71 [2019-03-28 12:36:17,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.49/77.71 [2019-03-28 12:36:17,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.49/77.71 [2019-03-28 12:36:17,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.49/77.71 [2019-03-28 12:36:17,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.49/77.71 [2019-03-28 12:36:17,332 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.49/77.71 [2019-03-28 12:36:17,332 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 122.49/77.71 [2019-03-28 12:36:17,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.49/77.71 [2019-03-28 12:36:17,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.49/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.49/77.71 Number of strict supporting invariants: 0 122.49/77.71 Number of non-strict supporting invariants: 1 122.49/77.71 Consider only non-deceasing supporting invariants: true 122.49/77.71 Simplify termination arguments: true 122.49/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.49/77.71 [2019-03-28 12:36:17,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.49/77.71 [2019-03-28 12:36:17,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.49/77.71 [2019-03-28 12:36:17,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.49/77.71 [2019-03-28 12:36:17,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.49/77.71 [2019-03-28 12:36:17,344 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.49/77.71 [2019-03-28 12:36:17,344 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 122.49/77.71 [2019-03-28 12:36:17,378 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 122.49/77.71 [2019-03-28 12:36:17,402 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 122.49/77.71 [2019-03-28 12:36:17,402 INFO L444 ModelExtractionUtils]: 48 out of 52 variables were initially zero. Simplification set additionally 1 variables to zero. 122.49/77.71 [2019-03-28 12:36:17,405 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 122.49/77.71 [2019-03-28 12:36:17,406 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 122.49/77.71 [2019-03-28 12:36:17,406 INFO L518 LassoAnalysis]: Proved termination. 122.49/77.71 [2019-03-28 12:36:17,407 INFO L520 LassoAnalysis]: Termination argument consisting of: 122.49/77.71 Ranking function f(ULTIMATE.start_cstrcspn_~p~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc6.base)_1) = -1*ULTIMATE.start_cstrcspn_~p~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc6.base)_1 122.49/77.71 Supporting invariants [] 122.49/77.71 [2019-03-28 12:36:17,456 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed 122.49/77.71 [2019-03-28 12:36:17,460 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.49/77.71 [2019-03-28 12:36:17,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.49/77.71 [2019-03-28 12:36:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.71 [2019-03-28 12:36:17,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core 122.49/77.71 [2019-03-28 12:36:17,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... 122.49/77.71 [2019-03-28 12:36:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.71 [2019-03-28 12:36:17,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 11 conjunts are in the unsatisfiable core 122.49/77.71 [2019-03-28 12:36:17,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... 122.49/77.71 [2019-03-28 12:36:17,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 122.49/77.71 [2019-03-28 12:36:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.71 [2019-03-28 12:36:17,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 11 conjunts are in the unsatisfiable core 122.49/77.71 [2019-03-28 12:36:17,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... 122.49/77.71 [2019-03-28 12:36:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.49/77.71 [2019-03-28 12:36:17,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 11 conjunts are in the unsatisfiable core 122.49/77.71 [2019-03-28 12:36:17,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... 122.49/77.71 [2019-03-28 12:36:17,726 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 8 predicates after loop cannibalization 122.49/77.71 [2019-03-28 12:36:17,730 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates 122.49/77.71 [2019-03-28 12:36:17,731 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 22 states. Second operand 5 states. 122.49/77.71 [2019-03-28 12:36:17,942 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 22 states.. Second operand 5 states. Result 38 states and 71 transitions. Complement of second has 7 states. 122.49/77.71 [2019-03-28 12:36:17,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states 122.49/77.71 [2019-03-28 12:36:17,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 122.49/77.71 [2019-03-28 12:36:17,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. 122.49/77.71 [2019-03-28 12:36:17,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62 transitions. Stem has 6 letters. Loop has 6 letters. 122.49/77.71 [2019-03-28 12:36:17,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. 122.49/77.71 [2019-03-28 12:36:17,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62 transitions. Stem has 12 letters. Loop has 6 letters. 122.49/77.71 [2019-03-28 12:36:17,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. 122.49/77.71 [2019-03-28 12:36:17,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62 transitions. Stem has 6 letters. Loop has 12 letters. 122.49/77.71 [2019-03-28 12:36:17,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. 122.49/77.71 [2019-03-28 12:36:17,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 71 transitions. 122.49/77.71 [2019-03-28 12:36:17,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 122.49/77.71 [2019-03-28 12:36:17,957 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 19 states and 30 transitions. 122.49/77.71 [2019-03-28 12:36:17,958 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 122.49/77.71 [2019-03-28 12:36:17,958 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 122.49/77.71 [2019-03-28 12:36:17,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 30 transitions. 122.49/77.71 [2019-03-28 12:36:17,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 122.49/77.71 [2019-03-28 12:36:17,959 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 30 transitions. 122.49/77.71 [2019-03-28 12:36:17,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 30 transitions. 122.49/77.71 [2019-03-28 12:36:17,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. 122.49/77.71 [2019-03-28 12:36:17,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 122.49/77.71 [2019-03-28 12:36:17,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 29 transitions. 122.49/77.71 [2019-03-28 12:36:17,962 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 29 transitions. 122.49/77.71 [2019-03-28 12:36:17,962 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 29 transitions. 122.49/77.71 [2019-03-28 12:36:17,962 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 122.49/77.71 [2019-03-28 12:36:17,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 29 transitions. 122.49/77.71 [2019-03-28 12:36:17,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 122.49/77.71 [2019-03-28 12:36:17,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 122.49/77.71 [2019-03-28 12:36:17,963 INFO L119 BuchiIsEmpty]: Starting construction of run 122.49/77.71 [2019-03-28 12:36:17,963 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 122.49/77.71 [2019-03-28 12:36:17,963 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 122.49/77.71 [2019-03-28 12:36:17,964 INFO L794 eck$LassoCheckResult]: Stem: 237#ULTIMATE.startENTRY [150] ULTIMATE.startENTRY-->L36: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~ret8=|v_ULTIMATE.start_main_#t~ret8_4|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~ret8, ULTIMATE.start_main_~length2~0] 238#L36 [102] L36-->L36-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 247#L36-2 [79] L36-2-->L39-1: Formula: (and (< v_ULTIMATE.start_main_~length2~0_5 1) (= v_ULTIMATE.start_main_~length2~0_4 1)) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_5} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length2~0] 243#L39-1 [121] L39-1-->L44: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc6.base_2| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc6.base_2| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc6.base_2|)) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc6.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc7.base_2| v_ULTIMATE.start_main_~length2~0_7)) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_2|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_2|, #valid=|v_#valid_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc7.offset] 244#L44 [95] L44-->L44-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 239#L44-1 [151] L44-1-->L22-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= v_ULTIMATE.start_cstrcspn_~s1.offset_4 |v_ULTIMATE.start_cstrcspn_#in~s1.offset_2|) (= v_ULTIMATE.start_cstrcspn_~s1.base_5 v_ULTIMATE.start_cstrcspn_~p~0.base_8) (= |v_ULTIMATE.start_cstrcspn_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= |v_ULTIMATE.start_cstrcspn_#in~s1.base_2| v_ULTIMATE.start_cstrcspn_~s1.base_5) (= |v_ULTIMATE.start_cstrcspn_#in~s2.offset_2| v_ULTIMATE.start_cstrcspn_~s2.offset_4) (= |v_ULTIMATE.start_cstrcspn_#in~s2.base_2| v_ULTIMATE.start_cstrcspn_~s2.base_4) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrcspn_#in~s1.offset_2|) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0))) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_cstrcspn_~s1.offset_4 v_ULTIMATE.start_cstrcspn_~p~0.offset_7) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrcspn_#in~s2.offset_2|) (= |v_ULTIMATE.start_cstrcspn_#in~s2.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_8|, ULTIMATE.start_cstrcspn_#t~post0.base=|v_ULTIMATE.start_cstrcspn_#t~post0.base_7|, ULTIMATE.start_cstrcspn_~s1.offset=v_ULTIMATE.start_cstrcspn_~s1.offset_4, ULTIMATE.start_cstrcspn_~s2.offset=v_ULTIMATE.start_cstrcspn_~s2.offset_4, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrcspn_#t~post0.offset=|v_ULTIMATE.start_cstrcspn_#t~post0.offset_6|, ULTIMATE.start_cstrcspn_#in~s2.base=|v_ULTIMATE.start_cstrcspn_#in~s2.base_2|, ULTIMATE.start_cstrcspn_#in~s1.base=|v_ULTIMATE.start_cstrcspn_#in~s1.base_2|, #length=|v_#length_12|, ULTIMATE.start_cstrcspn_#in~s1.offset=|v_ULTIMATE.start_cstrcspn_#in~s1.offset_2|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_8, ULTIMATE.start_cstrcspn_~spanp~0.offset=v_ULTIMATE.start_cstrcspn_~spanp~0.offset_6, ULTIMATE.start_cstrcspn_~s1.base=v_ULTIMATE.start_cstrcspn_~s1.base_5, ULTIMATE.start_cstrcspn_~s2.base=v_ULTIMATE.start_cstrcspn_~s2.base_4, ULTIMATE.start_cstrcspn_~spanp~0.base=v_ULTIMATE.start_cstrcspn_~spanp~0.base_6, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_7|, ULTIMATE.start_cstrcspn_#t~mem3=|v_ULTIMATE.start_cstrcspn_#t~mem3_6|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrcspn_~p~0.offset=v_ULTIMATE.start_cstrcspn_~p~0.offset_7, ULTIMATE.start_cstrcspn_#t~mem1=|v_ULTIMATE.start_cstrcspn_#t~mem1_5|, ULTIMATE.start_cstrcspn_~p~0.base=v_ULTIMATE.start_cstrcspn_~p~0.base_8, ULTIMATE.start_cstrcspn_#in~s2.offset=|v_ULTIMATE.start_cstrcspn_#in~s2.offset_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrcspn_#res=|v_ULTIMATE.start_cstrcspn_#res_4|, ULTIMATE.start_cstrcspn_~c~0=v_ULTIMATE.start_cstrcspn_~c~0_6} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~post2.base, ULTIMATE.start_cstrcspn_~spanp~0.offset, ULTIMATE.start_cstrcspn_~s1.base, ULTIMATE.start_cstrcspn_~s2.base, ULTIMATE.start_cstrcspn_#t~post0.base, ULTIMATE.start_cstrcspn_~s1.offset, ULTIMATE.start_cstrcspn_~spanp~0.base, ULTIMATE.start_cstrcspn_#t~post2.offset, ULTIMATE.start_cstrcspn_#t~mem3, ULTIMATE.start_cstrcspn_~p~0.offset, ULTIMATE.start_cstrcspn_#t~mem1, ULTIMATE.start_cstrcspn_~p~0.base, ULTIMATE.start_cstrcspn_~s2.offset, ULTIMATE.start_cstrcspn_#in~s2.offset, ULTIMATE.start_cstrcspn_#t~post0.offset, #memory_int, ULTIMATE.start_cstrcspn_#in~s2.base, ULTIMATE.start_cstrcspn_#in~s1.base, ULTIMATE.start_cstrcspn_#in~s1.offset, ULTIMATE.start_cstrcspn_#res, ULTIMATE.start_cstrcspn_~c~0, ULTIMATE.start_cstrcspn_~sc~0] 240#L22-2 [70] L22-2-->L23: Formula: (and (= |v_ULTIMATE.start_cstrcspn_#t~post0.base_2| v_ULTIMATE.start_cstrcspn_~p~0.base_5) (= v_ULTIMATE.start_cstrcspn_~p~0.base_4 |v_ULTIMATE.start_cstrcspn_#t~post0.base_2|) (= |v_ULTIMATE.start_cstrcspn_#t~post0.offset_2| v_ULTIMATE.start_cstrcspn_~p~0.offset_5) (= v_ULTIMATE.start_cstrcspn_~p~0.offset_4 (+ |v_ULTIMATE.start_cstrcspn_#t~post0.offset_2| 1))) InVars {ULTIMATE.start_cstrcspn_~p~0.base=v_ULTIMATE.start_cstrcspn_~p~0.base_5, ULTIMATE.start_cstrcspn_~p~0.offset=v_ULTIMATE.start_cstrcspn_~p~0.offset_5} OutVars{ULTIMATE.start_cstrcspn_#t~post0.offset=|v_ULTIMATE.start_cstrcspn_#t~post0.offset_2|, ULTIMATE.start_cstrcspn_~p~0.base=v_ULTIMATE.start_cstrcspn_~p~0.base_4, ULTIMATE.start_cstrcspn_#t~post0.base=|v_ULTIMATE.start_cstrcspn_#t~post0.base_2|, ULTIMATE.start_cstrcspn_~p~0.offset=v_ULTIMATE.start_cstrcspn_~p~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_~p~0.base, ULTIMATE.start_cstrcspn_#t~post0.offset, ULTIMATE.start_cstrcspn_#t~post0.base, ULTIMATE.start_cstrcspn_~p~0.offset] 245#L23 [152] L23-->L25-3: Formula: (and (<= 0 |v_ULTIMATE.start_cstrcspn_#t~post0.offset_8|) (<= (+ |v_ULTIMATE.start_cstrcspn_#t~post0.offset_8| 1) (select |v_#length_13| |v_ULTIMATE.start_cstrcspn_#t~post0.base_9|)) (= 1 (select |v_#valid_20| |v_ULTIMATE.start_cstrcspn_#t~post0.base_9|)) (= v_ULTIMATE.start_cstrcspn_~s2.base_5 v_ULTIMATE.start_cstrcspn_~spanp~0.base_7) (= v_ULTIMATE.start_cstrcspn_~c~0_7 (select (select |v_#memory_int_9| |v_ULTIMATE.start_cstrcspn_#t~post0.base_9|) |v_ULTIMATE.start_cstrcspn_#t~post0.offset_8|)) (= v_ULTIMATE.start_cstrcspn_~spanp~0.offset_7 v_ULTIMATE.start_cstrcspn_~s2.offset_5)) InVars {ULTIMATE.start_cstrcspn_~s2.offset=v_ULTIMATE.start_cstrcspn_~s2.offset_5, #valid=|v_#valid_20|, ULTIMATE.start_cstrcspn_#t~post0.offset=|v_ULTIMATE.start_cstrcspn_#t~post0.offset_8|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrcspn_~s2.base=v_ULTIMATE.start_cstrcspn_~s2.base_5, #length=|v_#length_13|, ULTIMATE.start_cstrcspn_#t~post0.base=|v_ULTIMATE.start_cstrcspn_#t~post0.base_9|} OutVars{ULTIMATE.start_cstrcspn_~s2.offset=v_ULTIMATE.start_cstrcspn_~s2.offset_5, #valid=|v_#valid_20|, ULTIMATE.start_cstrcspn_~spanp~0.offset=v_ULTIMATE.start_cstrcspn_~spanp~0.offset_7, ULTIMATE.start_cstrcspn_#t~post0.offset=|v_ULTIMATE.start_cstrcspn_#t~post0.offset_7|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrcspn_~s2.base=v_ULTIMATE.start_cstrcspn_~s2.base_5, #length=|v_#length_13|, ULTIMATE.start_cstrcspn_#t~post0.base=|v_ULTIMATE.start_cstrcspn_#t~post0.base_8|, ULTIMATE.start_cstrcspn_~spanp~0.base=v_ULTIMATE.start_cstrcspn_~spanp~0.base_7, ULTIMATE.start_cstrcspn_~c~0=v_ULTIMATE.start_cstrcspn_~c~0_7, ULTIMATE.start_cstrcspn_#t~mem1=|v_ULTIMATE.start_cstrcspn_#t~mem1_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_~spanp~0.offset, ULTIMATE.start_cstrcspn_#t~post0.offset, ULTIMATE.start_cstrcspn_#t~post0.base, ULTIMATE.start_cstrcspn_~spanp~0.base, ULTIMATE.start_cstrcspn_~c~0, ULTIMATE.start_cstrcspn_#t~mem1] 246#L25-3 [73] L25-3-->L26: Formula: (and (= v_ULTIMATE.start_cstrcspn_~spanp~0.base_4 |v_ULTIMATE.start_cstrcspn_#t~post2.base_2|) (= v_ULTIMATE.start_cstrcspn_~spanp~0.offset_4 (+ |v_ULTIMATE.start_cstrcspn_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrcspn_#t~post2.offset_2| v_ULTIMATE.start_cstrcspn_~spanp~0.offset_5) (= |v_ULTIMATE.start_cstrcspn_#t~post2.base_2| v_ULTIMATE.start_cstrcspn_~spanp~0.base_5)) InVars {ULTIMATE.start_cstrcspn_~spanp~0.offset=v_ULTIMATE.start_cstrcspn_~spanp~0.offset_5, ULTIMATE.start_cstrcspn_~spanp~0.base=v_ULTIMATE.start_cstrcspn_~spanp~0.base_5} OutVars{ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_2|, ULTIMATE.start_cstrcspn_~spanp~0.offset=v_ULTIMATE.start_cstrcspn_~spanp~0.offset_4, ULTIMATE.start_cstrcspn_~spanp~0.base=v_ULTIMATE.start_cstrcspn_~spanp~0.base_4, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~post2.base, ULTIMATE.start_cstrcspn_~spanp~0.offset, ULTIMATE.start_cstrcspn_~spanp~0.base, ULTIMATE.start_cstrcspn_#t~post2.offset] 233#L26 122.60/77.71 [2019-03-28 12:36:17,965 INFO L796 eck$LassoCheckResult]: Loop: 233#L26 [153] L26-->L26-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrcspn_#t~post2.offset_8|) (<= (+ |v_ULTIMATE.start_cstrcspn_#t~post2.offset_8| 1) (select |v_#length_14| |v_ULTIMATE.start_cstrcspn_#t~post2.base_9|)) (= v_ULTIMATE.start_cstrcspn_~sc~0_9 |v_ULTIMATE.start_cstrcspn_#t~mem3_7|) (= (select |v_#valid_21| |v_ULTIMATE.start_cstrcspn_#t~post2.base_9|) 1) (= |v_ULTIMATE.start_cstrcspn_#t~mem3_7| (select (select |v_#memory_int_10| |v_ULTIMATE.start_cstrcspn_#t~post2.base_9|) |v_ULTIMATE.start_cstrcspn_#t~post2.offset_8|))) InVars {ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_8|} OutVars{ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ULTIMATE.start_cstrcspn_#t~mem3=|v_ULTIMATE.start_cstrcspn_#t~mem3_7|, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_8|, ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_9} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~mem3, ULTIMATE.start_cstrcspn_~sc~0] 234#L26-2 [140] L26-2-->L25-1: Formula: (> v_ULTIMATE.start_cstrcspn_~sc~0_5 v_ULTIMATE.start_cstrcspn_~c~0_5) InVars {ULTIMATE.start_cstrcspn_~c~0=v_ULTIMATE.start_cstrcspn_~c~0_5, ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_5} OutVars{ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_7|, ULTIMATE.start_cstrcspn_~c~0=v_ULTIMATE.start_cstrcspn_~c~0_5, ULTIMATE.start_cstrcspn_#t~mem3=|v_ULTIMATE.start_cstrcspn_#t~mem3_5|, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_6|, ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~post2.base, ULTIMATE.start_cstrcspn_#t~mem3, ULTIMATE.start_cstrcspn_#t~post2.offset] 248#L25-1 [148] L25-1-->L25-3: Formula: (< v_ULTIMATE.start_cstrcspn_~sc~0_7 0) InVars {ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_7} OutVars{ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_7} AuxVars[] AssignedVars[] 241#L25-3 [73] L25-3-->L26: Formula: (and (= v_ULTIMATE.start_cstrcspn_~spanp~0.base_4 |v_ULTIMATE.start_cstrcspn_#t~post2.base_2|) (= v_ULTIMATE.start_cstrcspn_~spanp~0.offset_4 (+ |v_ULTIMATE.start_cstrcspn_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrcspn_#t~post2.offset_2| v_ULTIMATE.start_cstrcspn_~spanp~0.offset_5) (= |v_ULTIMATE.start_cstrcspn_#t~post2.base_2| v_ULTIMATE.start_cstrcspn_~spanp~0.base_5)) InVars {ULTIMATE.start_cstrcspn_~spanp~0.offset=v_ULTIMATE.start_cstrcspn_~spanp~0.offset_5, ULTIMATE.start_cstrcspn_~spanp~0.base=v_ULTIMATE.start_cstrcspn_~spanp~0.base_5} OutVars{ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_2|, ULTIMATE.start_cstrcspn_~spanp~0.offset=v_ULTIMATE.start_cstrcspn_~spanp~0.offset_4, ULTIMATE.start_cstrcspn_~spanp~0.base=v_ULTIMATE.start_cstrcspn_~spanp~0.base_4, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~post2.base, ULTIMATE.start_cstrcspn_~spanp~0.offset, ULTIMATE.start_cstrcspn_~spanp~0.base, ULTIMATE.start_cstrcspn_#t~post2.offset] 233#L26 122.60/77.71 [2019-03-28 12:36:17,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.60/77.71 [2019-03-28 12:36:17,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1596030756, now seen corresponding path program 1 times 122.60/77.71 [2019-03-28 12:36:17,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.60/77.71 [2019-03-28 12:36:17,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.60/77.71 [2019-03-28 12:36:17,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.60/77.71 [2019-03-28 12:36:17,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.60/77.71 [2019-03-28 12:36:17,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.60/77.71 [2019-03-28 12:36:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 122.60/77.71 [2019-03-28 12:36:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 122.60/77.71 [2019-03-28 12:36:17,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.60/77.71 [2019-03-28 12:36:17,983 INFO L82 PathProgramCache]: Analyzing trace with hash 5620745, now seen corresponding path program 1 times 122.60/77.71 [2019-03-28 12:36:17,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.60/77.71 [2019-03-28 12:36:17,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.60/77.71 [2019-03-28 12:36:17,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.60/77.71 [2019-03-28 12:36:17,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.60/77.71 [2019-03-28 12:36:17,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.60/77.71 [2019-03-28 12:36:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 122.60/77.71 [2019-03-28 12:36:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 122.60/77.71 [2019-03-28 12:36:17,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.60/77.71 [2019-03-28 12:36:17,989 INFO L82 PathProgramCache]: Analyzing trace with hash -426968660, now seen corresponding path program 1 times 122.60/77.71 [2019-03-28 12:36:17,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.60/77.71 [2019-03-28 12:36:17,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.60/77.71 [2019-03-28 12:36:17,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.60/77.71 [2019-03-28 12:36:17,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.60/77.71 [2019-03-28 12:36:17,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.60/77.71 [2019-03-28 12:36:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 122.60/77.71 [2019-03-28 12:36:18,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 122.60/77.71 [2019-03-28 12:36:18,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 122.60/77.71 [2019-03-28 12:36:18,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 122.60/77.71 [2019-03-28 12:36:18,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 122.60/77.71 [2019-03-28 12:36:18,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 122.60/77.71 [2019-03-28 12:36:18,113 INFO L87 Difference]: Start difference. First operand 18 states and 29 transitions. cyclomatic complexity: 13 Second operand 8 states. 122.60/77.71 [2019-03-28 12:36:18,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 122.60/77.71 [2019-03-28 12:36:18,295 INFO L93 Difference]: Finished difference Result 39 states and 57 transitions. 122.60/77.71 [2019-03-28 12:36:18,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 122.60/77.71 [2019-03-28 12:36:18,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 57 transitions. 122.60/77.71 [2019-03-28 12:36:18,300 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 122.60/77.71 [2019-03-28 12:36:18,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 22 states and 33 transitions. 122.60/77.71 [2019-03-28 12:36:18,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 122.60/77.71 [2019-03-28 12:36:18,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 122.60/77.71 [2019-03-28 12:36:18,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 33 transitions. 122.60/77.71 [2019-03-28 12:36:18,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 122.60/77.71 [2019-03-28 12:36:18,301 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 33 transitions. 122.60/77.71 [2019-03-28 12:36:18,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 33 transitions. 122.60/77.71 [2019-03-28 12:36:18,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. 122.60/77.71 [2019-03-28 12:36:18,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 122.60/77.71 [2019-03-28 12:36:18,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. 122.60/77.71 [2019-03-28 12:36:18,302 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. 122.60/77.71 [2019-03-28 12:36:18,302 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. 122.60/77.71 [2019-03-28 12:36:18,302 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 122.60/77.71 [2019-03-28 12:36:18,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 28 transitions. 122.60/77.71 [2019-03-28 12:36:18,303 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 122.60/77.71 [2019-03-28 12:36:18,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 122.60/77.71 [2019-03-28 12:36:18,303 INFO L119 BuchiIsEmpty]: Starting construction of run 122.60/77.71 [2019-03-28 12:36:18,303 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 122.60/77.71 [2019-03-28 12:36:18,304 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 122.60/77.71 [2019-03-28 12:36:18,304 INFO L794 eck$LassoCheckResult]: Stem: 319#ULTIMATE.startENTRY [150] ULTIMATE.startENTRY-->L36: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~ret8=|v_ULTIMATE.start_main_#t~ret8_4|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~ret8, ULTIMATE.start_main_~length2~0] 320#L36 [102] L36-->L36-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 329#L36-2 [103] L36-2-->L39-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 323#L39-1 [121] L39-1-->L44: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc6.base_2| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc6.base_2| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc6.base_2|)) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc6.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc7.base_2| v_ULTIMATE.start_main_~length2~0_7)) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_2|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_2|, #valid=|v_#valid_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc7.offset] 324#L44 [95] L44-->L44-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 321#L44-1 [151] L44-1-->L22-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= v_ULTIMATE.start_cstrcspn_~s1.offset_4 |v_ULTIMATE.start_cstrcspn_#in~s1.offset_2|) (= v_ULTIMATE.start_cstrcspn_~s1.base_5 v_ULTIMATE.start_cstrcspn_~p~0.base_8) (= |v_ULTIMATE.start_cstrcspn_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= |v_ULTIMATE.start_cstrcspn_#in~s1.base_2| v_ULTIMATE.start_cstrcspn_~s1.base_5) (= |v_ULTIMATE.start_cstrcspn_#in~s2.offset_2| v_ULTIMATE.start_cstrcspn_~s2.offset_4) (= |v_ULTIMATE.start_cstrcspn_#in~s2.base_2| v_ULTIMATE.start_cstrcspn_~s2.base_4) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrcspn_#in~s1.offset_2|) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0))) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_cstrcspn_~s1.offset_4 v_ULTIMATE.start_cstrcspn_~p~0.offset_7) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrcspn_#in~s2.offset_2|) (= |v_ULTIMATE.start_cstrcspn_#in~s2.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_8|, ULTIMATE.start_cstrcspn_#t~post0.base=|v_ULTIMATE.start_cstrcspn_#t~post0.base_7|, ULTIMATE.start_cstrcspn_~s1.offset=v_ULTIMATE.start_cstrcspn_~s1.offset_4, ULTIMATE.start_cstrcspn_~s2.offset=v_ULTIMATE.start_cstrcspn_~s2.offset_4, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrcspn_#t~post0.offset=|v_ULTIMATE.start_cstrcspn_#t~post0.offset_6|, ULTIMATE.start_cstrcspn_#in~s2.base=|v_ULTIMATE.start_cstrcspn_#in~s2.base_2|, ULTIMATE.start_cstrcspn_#in~s1.base=|v_ULTIMATE.start_cstrcspn_#in~s1.base_2|, #length=|v_#length_12|, ULTIMATE.start_cstrcspn_#in~s1.offset=|v_ULTIMATE.start_cstrcspn_#in~s1.offset_2|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_8, ULTIMATE.start_cstrcspn_~spanp~0.offset=v_ULTIMATE.start_cstrcspn_~spanp~0.offset_6, ULTIMATE.start_cstrcspn_~s1.base=v_ULTIMATE.start_cstrcspn_~s1.base_5, ULTIMATE.start_cstrcspn_~s2.base=v_ULTIMATE.start_cstrcspn_~s2.base_4, ULTIMATE.start_cstrcspn_~spanp~0.base=v_ULTIMATE.start_cstrcspn_~spanp~0.base_6, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_7|, ULTIMATE.start_cstrcspn_#t~mem3=|v_ULTIMATE.start_cstrcspn_#t~mem3_6|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrcspn_~p~0.offset=v_ULTIMATE.start_cstrcspn_~p~0.offset_7, ULTIMATE.start_cstrcspn_#t~mem1=|v_ULTIMATE.start_cstrcspn_#t~mem1_5|, ULTIMATE.start_cstrcspn_~p~0.base=v_ULTIMATE.start_cstrcspn_~p~0.base_8, ULTIMATE.start_cstrcspn_#in~s2.offset=|v_ULTIMATE.start_cstrcspn_#in~s2.offset_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrcspn_#res=|v_ULTIMATE.start_cstrcspn_#res_4|, ULTIMATE.start_cstrcspn_~c~0=v_ULTIMATE.start_cstrcspn_~c~0_6} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~post2.base, ULTIMATE.start_cstrcspn_~spanp~0.offset, ULTIMATE.start_cstrcspn_~s1.base, ULTIMATE.start_cstrcspn_~s2.base, ULTIMATE.start_cstrcspn_#t~post0.base, ULTIMATE.start_cstrcspn_~s1.offset, ULTIMATE.start_cstrcspn_~spanp~0.base, ULTIMATE.start_cstrcspn_#t~post2.offset, ULTIMATE.start_cstrcspn_#t~mem3, ULTIMATE.start_cstrcspn_~p~0.offset, ULTIMATE.start_cstrcspn_#t~mem1, ULTIMATE.start_cstrcspn_~p~0.base, ULTIMATE.start_cstrcspn_~s2.offset, ULTIMATE.start_cstrcspn_#in~s2.offset, ULTIMATE.start_cstrcspn_#t~post0.offset, #memory_int, ULTIMATE.start_cstrcspn_#in~s2.base, ULTIMATE.start_cstrcspn_#in~s1.base, ULTIMATE.start_cstrcspn_#in~s1.offset, ULTIMATE.start_cstrcspn_#res, ULTIMATE.start_cstrcspn_~c~0, ULTIMATE.start_cstrcspn_~sc~0] 322#L22-2 [70] L22-2-->L23: Formula: (and (= |v_ULTIMATE.start_cstrcspn_#t~post0.base_2| v_ULTIMATE.start_cstrcspn_~p~0.base_5) (= v_ULTIMATE.start_cstrcspn_~p~0.base_4 |v_ULTIMATE.start_cstrcspn_#t~post0.base_2|) (= |v_ULTIMATE.start_cstrcspn_#t~post0.offset_2| v_ULTIMATE.start_cstrcspn_~p~0.offset_5) (= v_ULTIMATE.start_cstrcspn_~p~0.offset_4 (+ |v_ULTIMATE.start_cstrcspn_#t~post0.offset_2| 1))) InVars {ULTIMATE.start_cstrcspn_~p~0.base=v_ULTIMATE.start_cstrcspn_~p~0.base_5, ULTIMATE.start_cstrcspn_~p~0.offset=v_ULTIMATE.start_cstrcspn_~p~0.offset_5} OutVars{ULTIMATE.start_cstrcspn_#t~post0.offset=|v_ULTIMATE.start_cstrcspn_#t~post0.offset_2|, ULTIMATE.start_cstrcspn_~p~0.base=v_ULTIMATE.start_cstrcspn_~p~0.base_4, ULTIMATE.start_cstrcspn_#t~post0.base=|v_ULTIMATE.start_cstrcspn_#t~post0.base_2|, ULTIMATE.start_cstrcspn_~p~0.offset=v_ULTIMATE.start_cstrcspn_~p~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_~p~0.base, ULTIMATE.start_cstrcspn_#t~post0.offset, ULTIMATE.start_cstrcspn_#t~post0.base, ULTIMATE.start_cstrcspn_~p~0.offset] 327#L23 [152] L23-->L25-3: Formula: (and (<= 0 |v_ULTIMATE.start_cstrcspn_#t~post0.offset_8|) (<= (+ |v_ULTIMATE.start_cstrcspn_#t~post0.offset_8| 1) (select |v_#length_13| |v_ULTIMATE.start_cstrcspn_#t~post0.base_9|)) (= 1 (select |v_#valid_20| |v_ULTIMATE.start_cstrcspn_#t~post0.base_9|)) (= v_ULTIMATE.start_cstrcspn_~s2.base_5 v_ULTIMATE.start_cstrcspn_~spanp~0.base_7) (= v_ULTIMATE.start_cstrcspn_~c~0_7 (select (select |v_#memory_int_9| |v_ULTIMATE.start_cstrcspn_#t~post0.base_9|) |v_ULTIMATE.start_cstrcspn_#t~post0.offset_8|)) (= v_ULTIMATE.start_cstrcspn_~spanp~0.offset_7 v_ULTIMATE.start_cstrcspn_~s2.offset_5)) InVars {ULTIMATE.start_cstrcspn_~s2.offset=v_ULTIMATE.start_cstrcspn_~s2.offset_5, #valid=|v_#valid_20|, ULTIMATE.start_cstrcspn_#t~post0.offset=|v_ULTIMATE.start_cstrcspn_#t~post0.offset_8|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrcspn_~s2.base=v_ULTIMATE.start_cstrcspn_~s2.base_5, #length=|v_#length_13|, ULTIMATE.start_cstrcspn_#t~post0.base=|v_ULTIMATE.start_cstrcspn_#t~post0.base_9|} OutVars{ULTIMATE.start_cstrcspn_~s2.offset=v_ULTIMATE.start_cstrcspn_~s2.offset_5, #valid=|v_#valid_20|, ULTIMATE.start_cstrcspn_~spanp~0.offset=v_ULTIMATE.start_cstrcspn_~spanp~0.offset_7, ULTIMATE.start_cstrcspn_#t~post0.offset=|v_ULTIMATE.start_cstrcspn_#t~post0.offset_7|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrcspn_~s2.base=v_ULTIMATE.start_cstrcspn_~s2.base_5, #length=|v_#length_13|, ULTIMATE.start_cstrcspn_#t~post0.base=|v_ULTIMATE.start_cstrcspn_#t~post0.base_8|, ULTIMATE.start_cstrcspn_~spanp~0.base=v_ULTIMATE.start_cstrcspn_~spanp~0.base_7, ULTIMATE.start_cstrcspn_~c~0=v_ULTIMATE.start_cstrcspn_~c~0_7, ULTIMATE.start_cstrcspn_#t~mem1=|v_ULTIMATE.start_cstrcspn_#t~mem1_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_~spanp~0.offset, ULTIMATE.start_cstrcspn_#t~post0.offset, ULTIMATE.start_cstrcspn_#t~post0.base, ULTIMATE.start_cstrcspn_~spanp~0.base, ULTIMATE.start_cstrcspn_~c~0, ULTIMATE.start_cstrcspn_#t~mem1] 328#L25-3 [73] L25-3-->L26: Formula: (and (= v_ULTIMATE.start_cstrcspn_~spanp~0.base_4 |v_ULTIMATE.start_cstrcspn_#t~post2.base_2|) (= v_ULTIMATE.start_cstrcspn_~spanp~0.offset_4 (+ |v_ULTIMATE.start_cstrcspn_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrcspn_#t~post2.offset_2| v_ULTIMATE.start_cstrcspn_~spanp~0.offset_5) (= |v_ULTIMATE.start_cstrcspn_#t~post2.base_2| v_ULTIMATE.start_cstrcspn_~spanp~0.base_5)) InVars {ULTIMATE.start_cstrcspn_~spanp~0.offset=v_ULTIMATE.start_cstrcspn_~spanp~0.offset_5, ULTIMATE.start_cstrcspn_~spanp~0.base=v_ULTIMATE.start_cstrcspn_~spanp~0.base_5} OutVars{ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_2|, ULTIMATE.start_cstrcspn_~spanp~0.offset=v_ULTIMATE.start_cstrcspn_~spanp~0.offset_4, ULTIMATE.start_cstrcspn_~spanp~0.base=v_ULTIMATE.start_cstrcspn_~spanp~0.base_4, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~post2.base, ULTIMATE.start_cstrcspn_~spanp~0.offset, ULTIMATE.start_cstrcspn_~spanp~0.base, ULTIMATE.start_cstrcspn_#t~post2.offset] 315#L26 122.60/77.71 [2019-03-28 12:36:18,305 INFO L796 eck$LassoCheckResult]: Loop: 315#L26 [153] L26-->L26-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrcspn_#t~post2.offset_8|) (<= (+ |v_ULTIMATE.start_cstrcspn_#t~post2.offset_8| 1) (select |v_#length_14| |v_ULTIMATE.start_cstrcspn_#t~post2.base_9|)) (= v_ULTIMATE.start_cstrcspn_~sc~0_9 |v_ULTIMATE.start_cstrcspn_#t~mem3_7|) (= (select |v_#valid_21| |v_ULTIMATE.start_cstrcspn_#t~post2.base_9|) 1) (= |v_ULTIMATE.start_cstrcspn_#t~mem3_7| (select (select |v_#memory_int_10| |v_ULTIMATE.start_cstrcspn_#t~post2.base_9|) |v_ULTIMATE.start_cstrcspn_#t~post2.offset_8|))) InVars {ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_8|} OutVars{ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ULTIMATE.start_cstrcspn_#t~mem3=|v_ULTIMATE.start_cstrcspn_#t~mem3_7|, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_8|, ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_9} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~mem3, ULTIMATE.start_cstrcspn_~sc~0] 316#L26-2 [140] L26-2-->L25-1: Formula: (> v_ULTIMATE.start_cstrcspn_~sc~0_5 v_ULTIMATE.start_cstrcspn_~c~0_5) InVars {ULTIMATE.start_cstrcspn_~c~0=v_ULTIMATE.start_cstrcspn_~c~0_5, ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_5} OutVars{ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_7|, ULTIMATE.start_cstrcspn_~c~0=v_ULTIMATE.start_cstrcspn_~c~0_5, ULTIMATE.start_cstrcspn_#t~mem3=|v_ULTIMATE.start_cstrcspn_#t~mem3_5|, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_6|, ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~post2.base, ULTIMATE.start_cstrcspn_#t~mem3, ULTIMATE.start_cstrcspn_#t~post2.offset] 330#L25-1 [148] L25-1-->L25-3: Formula: (< v_ULTIMATE.start_cstrcspn_~sc~0_7 0) InVars {ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_7} OutVars{ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_7} AuxVars[] AssignedVars[] 325#L25-3 [73] L25-3-->L26: Formula: (and (= v_ULTIMATE.start_cstrcspn_~spanp~0.base_4 |v_ULTIMATE.start_cstrcspn_#t~post2.base_2|) (= v_ULTIMATE.start_cstrcspn_~spanp~0.offset_4 (+ |v_ULTIMATE.start_cstrcspn_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrcspn_#t~post2.offset_2| v_ULTIMATE.start_cstrcspn_~spanp~0.offset_5) (= |v_ULTIMATE.start_cstrcspn_#t~post2.base_2| v_ULTIMATE.start_cstrcspn_~spanp~0.base_5)) InVars {ULTIMATE.start_cstrcspn_~spanp~0.offset=v_ULTIMATE.start_cstrcspn_~spanp~0.offset_5, ULTIMATE.start_cstrcspn_~spanp~0.base=v_ULTIMATE.start_cstrcspn_~spanp~0.base_5} OutVars{ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_2|, ULTIMATE.start_cstrcspn_~spanp~0.offset=v_ULTIMATE.start_cstrcspn_~spanp~0.offset_4, ULTIMATE.start_cstrcspn_~spanp~0.base=v_ULTIMATE.start_cstrcspn_~spanp~0.base_4, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~post2.base, ULTIMATE.start_cstrcspn_~spanp~0.offset, ULTIMATE.start_cstrcspn_~spanp~0.base, ULTIMATE.start_cstrcspn_#t~post2.offset] 315#L26 122.60/77.71 [2019-03-28 12:36:18,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.60/77.71 [2019-03-28 12:36:18,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1421282620, now seen corresponding path program 1 times 122.60/77.71 [2019-03-28 12:36:18,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.60/77.71 [2019-03-28 12:36:18,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.60/77.71 [2019-03-28 12:36:18,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.60/77.71 [2019-03-28 12:36:18,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.60/77.71 [2019-03-28 12:36:18,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.60/77.71 [2019-03-28 12:36:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 122.60/77.71 [2019-03-28 12:36:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 122.60/77.71 [2019-03-28 12:36:18,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.60/77.71 [2019-03-28 12:36:18,320 INFO L82 PathProgramCache]: Analyzing trace with hash 5620745, now seen corresponding path program 2 times 122.60/77.71 [2019-03-28 12:36:18,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.60/77.71 [2019-03-28 12:36:18,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.60/77.71 [2019-03-28 12:36:18,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.60/77.71 [2019-03-28 12:36:18,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.60/77.71 [2019-03-28 12:36:18,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.60/77.71 [2019-03-28 12:36:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 122.60/77.71 [2019-03-28 12:36:18,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 122.60/77.71 [2019-03-28 12:36:18,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.60/77.71 [2019-03-28 12:36:18,326 INFO L82 PathProgramCache]: Analyzing trace with hash -604128316, now seen corresponding path program 1 times 122.60/77.71 [2019-03-28 12:36:18,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.60/77.71 [2019-03-28 12:36:18,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.60/77.71 [2019-03-28 12:36:18,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.60/77.71 [2019-03-28 12:36:18,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 122.60/77.71 [2019-03-28 12:36:18,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.60/77.71 [2019-03-28 12:36:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 122.60/77.71 [2019-03-28 12:36:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 122.60/77.71 [2019-03-28 12:36:18,786 WARN L188 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 106 122.60/77.71 [2019-03-28 12:36:18,914 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 90 122.60/77.71 [2019-03-28 12:36:18,917 INFO L216 LassoAnalysis]: Preferences: 122.60/77.71 [2019-03-28 12:36:18,917 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 122.60/77.71 [2019-03-28 12:36:18,918 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 122.60/77.71 [2019-03-28 12:36:18,918 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 122.60/77.71 [2019-03-28 12:36:18,918 INFO L127 ssoRankerPreferences]: Use exernal solver: false 122.60/77.71 [2019-03-28 12:36:18,918 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 122.60/77.71 [2019-03-28 12:36:18,918 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 122.60/77.71 [2019-03-28 12:36:18,918 INFO L130 ssoRankerPreferences]: Path of dumped script: 122.60/77.71 [2019-03-28 12:36:18,918 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso 122.60/77.71 [2019-03-28 12:36:18,918 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 122.60/77.71 [2019-03-28 12:36:18,919 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 122.60/77.71 [2019-03-28 12:36:18,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.60/77.71 [2019-03-28 12:36:18,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.60/77.71 [2019-03-28 12:36:18,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.60/77.71 [2019-03-28 12:36:19,227 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 122.60/77.71 [2019-03-28 12:36:19,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.60/77.71 [2019-03-28 12:36:19,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.60/77.71 [2019-03-28 12:36:19,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.60/77.71 [2019-03-28 12:36:19,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.60/77.71 [2019-03-28 12:36:19,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.60/77.71 [2019-03-28 12:36:19,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.60/77.71 [2019-03-28 12:36:19,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.60/77.71 [2019-03-28 12:36:19,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.60/77.71 [2019-03-28 12:36:19,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.60/77.71 [2019-03-28 12:36:19,581 INFO L300 LassoAnalysis]: Preprocessing complete. 122.60/77.71 [2019-03-28 12:36:19,581 INFO L497 LassoAnalysis]: Using template 'affine'. 122.60/77.71 [2019-03-28 12:36:19,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.71 Number of strict supporting invariants: 0 122.60/77.71 Number of non-strict supporting invariants: 1 122.60/77.71 Consider only non-deceasing supporting invariants: true 122.60/77.71 Simplify termination arguments: true 122.60/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.71 [2019-03-28 12:36:19,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.71 [2019-03-28 12:36:19,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.71 [2019-03-28 12:36:19,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.71 [2019-03-28 12:36:19,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.71 [2019-03-28 12:36:19,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.71 [2019-03-28 12:36:19,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 122.60/77.71 [2019-03-28 12:36:19,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.71 [2019-03-28 12:36:19,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.71 [2019-03-28 12:36:19,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.71 Number of strict supporting invariants: 0 122.60/77.71 Number of non-strict supporting invariants: 1 122.60/77.71 Consider only non-deceasing supporting invariants: true 122.60/77.71 Simplify termination arguments: true 122.60/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.71 [2019-03-28 12:36:19,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.71 [2019-03-28 12:36:19,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.71 [2019-03-28 12:36:19,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.71 [2019-03-28 12:36:19,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.71 [2019-03-28 12:36:19,586 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.71 [2019-03-28 12:36:19,586 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 122.60/77.71 [2019-03-28 12:36:19,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.71 [2019-03-28 12:36:19,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.71 Number of strict supporting invariants: 0 122.60/77.71 Number of non-strict supporting invariants: 1 122.60/77.71 Consider only non-deceasing supporting invariants: true 122.60/77.71 Simplify termination arguments: true 122.60/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.71 [2019-03-28 12:36:19,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.71 [2019-03-28 12:36:19,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.71 [2019-03-28 12:36:19,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.71 [2019-03-28 12:36:19,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.71 [2019-03-28 12:36:19,591 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.71 [2019-03-28 12:36:19,591 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 122.60/77.71 [2019-03-28 12:36:19,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.71 [2019-03-28 12:36:19,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.71 Number of strict supporting invariants: 0 122.60/77.71 Number of non-strict supporting invariants: 1 122.60/77.71 Consider only non-deceasing supporting invariants: true 122.60/77.71 Simplify termination arguments: true 122.60/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.71 [2019-03-28 12:36:19,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.71 [2019-03-28 12:36:19,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.71 [2019-03-28 12:36:19,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.71 [2019-03-28 12:36:19,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.71 [2019-03-28 12:36:19,608 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.71 [2019-03-28 12:36:19,608 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 122.60/77.71 [2019-03-28 12:36:19,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.71 [2019-03-28 12:36:19,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.71 Number of strict supporting invariants: 0 122.60/77.71 Number of non-strict supporting invariants: 1 122.60/77.71 Consider only non-deceasing supporting invariants: true 122.60/77.71 Simplify termination arguments: true 122.60/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.71 [2019-03-28 12:36:19,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.71 [2019-03-28 12:36:19,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.71 [2019-03-28 12:36:19,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.71 [2019-03-28 12:36:19,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.71 [2019-03-28 12:36:19,612 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.71 [2019-03-28 12:36:19,612 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 122.60/77.71 [2019-03-28 12:36:19,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.71 [2019-03-28 12:36:19,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.71 Number of strict supporting invariants: 0 122.60/77.71 Number of non-strict supporting invariants: 1 122.60/77.71 Consider only non-deceasing supporting invariants: true 122.60/77.71 Simplify termination arguments: true 122.60/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.71 [2019-03-28 12:36:19,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.71 [2019-03-28 12:36:19,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.71 [2019-03-28 12:36:19,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.71 [2019-03-28 12:36:19,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.71 [2019-03-28 12:36:19,618 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.71 [2019-03-28 12:36:19,618 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 122.60/77.71 [2019-03-28 12:36:19,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.71 [2019-03-28 12:36:19,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.71 Number of strict supporting invariants: 0 122.60/77.71 Number of non-strict supporting invariants: 1 122.60/77.71 Consider only non-deceasing supporting invariants: true 122.60/77.71 Simplify termination arguments: true 122.60/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.71 [2019-03-28 12:36:19,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.71 [2019-03-28 12:36:19,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.71 [2019-03-28 12:36:19,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.71 [2019-03-28 12:36:19,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.71 [2019-03-28 12:36:19,621 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.71 [2019-03-28 12:36:19,621 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 122.60/77.71 [2019-03-28 12:36:19,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.71 [2019-03-28 12:36:19,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.71 Number of strict supporting invariants: 0 122.60/77.71 Number of non-strict supporting invariants: 1 122.60/77.71 Consider only non-deceasing supporting invariants: true 122.60/77.71 Simplify termination arguments: true 122.60/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.71 [2019-03-28 12:36:19,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.71 [2019-03-28 12:36:19,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.71 [2019-03-28 12:36:19,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.71 [2019-03-28 12:36:19,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.71 [2019-03-28 12:36:19,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.71 [2019-03-28 12:36:19,624 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 122.60/77.71 [2019-03-28 12:36:19,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.71 [2019-03-28 12:36:19,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.71 Number of strict supporting invariants: 0 122.60/77.71 Number of non-strict supporting invariants: 1 122.60/77.71 Consider only non-deceasing supporting invariants: true 122.60/77.71 Simplify termination arguments: true 122.60/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.71 [2019-03-28 12:36:19,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.71 [2019-03-28 12:36:19,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.71 [2019-03-28 12:36:19,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.71 [2019-03-28 12:36:19,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.71 [2019-03-28 12:36:19,628 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.71 [2019-03-28 12:36:19,628 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 122.60/77.71 [2019-03-28 12:36:19,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.71 [2019-03-28 12:36:19,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.71 Number of strict supporting invariants: 0 122.60/77.71 Number of non-strict supporting invariants: 1 122.60/77.71 Consider only non-deceasing supporting invariants: true 122.60/77.71 Simplify termination arguments: true 122.60/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.71 [2019-03-28 12:36:19,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.71 [2019-03-28 12:36:19,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.71 [2019-03-28 12:36:19,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.71 [2019-03-28 12:36:19,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.71 [2019-03-28 12:36:19,631 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.71 [2019-03-28 12:36:19,631 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 122.60/77.71 [2019-03-28 12:36:19,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.71 [2019-03-28 12:36:19,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.71 Number of strict supporting invariants: 0 122.60/77.71 Number of non-strict supporting invariants: 1 122.60/77.71 Consider only non-deceasing supporting invariants: true 122.60/77.71 Simplify termination arguments: true 122.60/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.71 [2019-03-28 12:36:19,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.71 [2019-03-28 12:36:19,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.71 [2019-03-28 12:36:19,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.71 [2019-03-28 12:36:19,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.71 [2019-03-28 12:36:19,636 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.71 [2019-03-28 12:36:19,636 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 122.60/77.71 [2019-03-28 12:36:19,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.71 [2019-03-28 12:36:19,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.71 Number of strict supporting invariants: 0 122.60/77.71 Number of non-strict supporting invariants: 1 122.60/77.71 Consider only non-deceasing supporting invariants: true 122.60/77.71 Simplify termination arguments: true 122.60/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.71 [2019-03-28 12:36:19,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.71 [2019-03-28 12:36:19,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.71 [2019-03-28 12:36:19,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.71 [2019-03-28 12:36:19,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.71 [2019-03-28 12:36:19,642 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.71 [2019-03-28 12:36:19,643 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 122.60/77.71 [2019-03-28 12:36:19,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.71 [2019-03-28 12:36:19,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.71 Number of strict supporting invariants: 0 122.60/77.71 Number of non-strict supporting invariants: 1 122.60/77.71 Consider only non-deceasing supporting invariants: true 122.60/77.71 Simplify termination arguments: true 122.60/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.71 [2019-03-28 12:36:19,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.71 [2019-03-28 12:36:19,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.71 [2019-03-28 12:36:19,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.71 [2019-03-28 12:36:19,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.71 [2019-03-28 12:36:19,649 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.71 [2019-03-28 12:36:19,649 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 122.60/77.71 [2019-03-28 12:36:19,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.71 [2019-03-28 12:36:19,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.71 Number of strict supporting invariants: 0 122.60/77.71 Number of non-strict supporting invariants: 1 122.60/77.71 Consider only non-deceasing supporting invariants: true 122.60/77.71 Simplify termination arguments: true 122.60/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.71 [2019-03-28 12:36:19,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.71 [2019-03-28 12:36:19,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.71 [2019-03-28 12:36:19,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.71 [2019-03-28 12:36:19,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.71 [2019-03-28 12:36:19,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.71 [2019-03-28 12:36:19,652 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 122.60/77.71 [2019-03-28 12:36:19,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.71 [2019-03-28 12:36:19,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.71 [2019-03-28 12:36:19,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.71 Number of strict supporting invariants: 0 122.60/77.71 Number of non-strict supporting invariants: 1 122.60/77.71 Consider only non-deceasing supporting invariants: true 122.60/77.71 Simplify termination arguments: true 122.60/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.71 [2019-03-28 12:36:19,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.71 [2019-03-28 12:36:19,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.71 [2019-03-28 12:36:19,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.71 [2019-03-28 12:36:19,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.71 [2019-03-28 12:36:19,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.71 [2019-03-28 12:36:19,654 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 122.60/77.71 [2019-03-28 12:36:19,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.71 [2019-03-28 12:36:19,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.71 [2019-03-28 12:36:19,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.71 Number of strict supporting invariants: 0 122.60/77.71 Number of non-strict supporting invariants: 1 122.60/77.71 Consider only non-deceasing supporting invariants: true 122.60/77.71 Simplify termination arguments: true 122.60/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.71 [2019-03-28 12:36:19,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.71 [2019-03-28 12:36:19,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.71 [2019-03-28 12:36:19,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.71 [2019-03-28 12:36:19,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.71 [2019-03-28 12:36:19,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.71 [2019-03-28 12:36:19,656 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 122.60/77.71 [2019-03-28 12:36:19,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.71 [2019-03-28 12:36:19,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.71 Number of strict supporting invariants: 0 122.60/77.71 Number of non-strict supporting invariants: 1 122.60/77.71 Consider only non-deceasing supporting invariants: true 122.60/77.71 Simplify termination arguments: true 122.60/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.71 [2019-03-28 12:36:19,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.71 [2019-03-28 12:36:19,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.71 [2019-03-28 12:36:19,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.71 [2019-03-28 12:36:19,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.71 [2019-03-28 12:36:19,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.71 [2019-03-28 12:36:19,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 122.60/77.71 [2019-03-28 12:36:19,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.71 [2019-03-28 12:36:19,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.71 [2019-03-28 12:36:19,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.71 Number of strict supporting invariants: 0 122.60/77.71 Number of non-strict supporting invariants: 1 122.60/77.71 Consider only non-deceasing supporting invariants: true 122.60/77.71 Simplify termination arguments: true 122.60/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.71 [2019-03-28 12:36:19,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.71 [2019-03-28 12:36:19,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.71 [2019-03-28 12:36:19,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.71 [2019-03-28 12:36:19,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.71 [2019-03-28 12:36:19,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.71 [2019-03-28 12:36:19,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 122.60/77.71 [2019-03-28 12:36:19,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.71 [2019-03-28 12:36:19,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.71 [2019-03-28 12:36:19,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.71 Number of strict supporting invariants: 0 122.60/77.71 Number of non-strict supporting invariants: 1 122.60/77.71 Consider only non-deceasing supporting invariants: true 122.60/77.71 Simplify termination arguments: true 122.60/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.71 [2019-03-28 12:36:19,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.71 [2019-03-28 12:36:19,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.71 [2019-03-28 12:36:19,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.71 [2019-03-28 12:36:19,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.71 [2019-03-28 12:36:19,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.71 [2019-03-28 12:36:19,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 122.60/77.71 [2019-03-28 12:36:19,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.71 [2019-03-28 12:36:19,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.71 [2019-03-28 12:36:19,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.71 Number of strict supporting invariants: 0 122.60/77.71 Number of non-strict supporting invariants: 1 122.60/77.71 Consider only non-deceasing supporting invariants: true 122.60/77.71 Simplify termination arguments: true 122.60/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.71 [2019-03-28 12:36:19,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.71 [2019-03-28 12:36:19,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.71 [2019-03-28 12:36:19,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.71 [2019-03-28 12:36:19,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.71 [2019-03-28 12:36:19,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.71 [2019-03-28 12:36:19,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 122.60/77.71 [2019-03-28 12:36:19,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.71 [2019-03-28 12:36:19,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.71 [2019-03-28 12:36:19,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.71 Number of strict supporting invariants: 0 122.60/77.71 Number of non-strict supporting invariants: 1 122.60/77.71 Consider only non-deceasing supporting invariants: true 122.60/77.71 Simplify termination arguments: true 122.60/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.71 [2019-03-28 12:36:19,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.71 [2019-03-28 12:36:19,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.71 [2019-03-28 12:36:19,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.71 [2019-03-28 12:36:19,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.71 [2019-03-28 12:36:19,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.71 [2019-03-28 12:36:19,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 122.60/77.71 [2019-03-28 12:36:19,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.71 [2019-03-28 12:36:19,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.71 [2019-03-28 12:36:19,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.71 Number of strict supporting invariants: 0 122.60/77.71 Number of non-strict supporting invariants: 1 122.60/77.71 Consider only non-deceasing supporting invariants: true 122.60/77.71 Simplify termination arguments: true 122.60/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.71 [2019-03-28 12:36:19,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.71 [2019-03-28 12:36:19,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.71 [2019-03-28 12:36:19,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.71 [2019-03-28 12:36:19,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.71 [2019-03-28 12:36:19,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.71 [2019-03-28 12:36:19,668 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 122.60/77.71 [2019-03-28 12:36:19,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.71 [2019-03-28 12:36:19,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.71 [2019-03-28 12:36:19,669 INFO L497 LassoAnalysis]: Using template '2-nested'. 122.60/77.71 [2019-03-28 12:36:19,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.71 Number of strict supporting invariants: 0 122.60/77.71 Number of non-strict supporting invariants: 1 122.60/77.71 Consider only non-deceasing supporting invariants: true 122.60/77.71 Simplify termination arguments: true 122.60/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.71 [2019-03-28 12:36:19,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.71 [2019-03-28 12:36:19,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.71 [2019-03-28 12:36:19,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.71 [2019-03-28 12:36:19,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.71 [2019-03-28 12:36:19,670 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.71 [2019-03-28 12:36:19,671 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 122.60/77.71 [2019-03-28 12:36:19,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.71 [2019-03-28 12:36:19,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.71 [2019-03-28 12:36:19,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.71 Number of strict supporting invariants: 0 122.60/77.71 Number of non-strict supporting invariants: 1 122.60/77.71 Consider only non-deceasing supporting invariants: true 122.60/77.71 Simplify termination arguments: true 122.60/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.71 [2019-03-28 12:36:19,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.71 [2019-03-28 12:36:19,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.71 [2019-03-28 12:36:19,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.71 [2019-03-28 12:36:19,672 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.71 [2019-03-28 12:36:19,673 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.71 [2019-03-28 12:36:19,673 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.71 [2019-03-28 12:36:19,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.71 [2019-03-28 12:36:19,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.71 Number of strict supporting invariants: 0 122.60/77.71 Number of non-strict supporting invariants: 1 122.60/77.71 Consider only non-deceasing supporting invariants: true 122.60/77.71 Simplify termination arguments: true 122.60/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.71 [2019-03-28 12:36:19,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.71 [2019-03-28 12:36:19,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.71 [2019-03-28 12:36:19,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.71 [2019-03-28 12:36:19,676 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.71 [2019-03-28 12:36:19,679 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.71 [2019-03-28 12:36:19,679 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.71 [2019-03-28 12:36:19,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.71 [2019-03-28 12:36:19,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.71 Number of strict supporting invariants: 0 122.60/77.71 Number of non-strict supporting invariants: 1 122.60/77.71 Consider only non-deceasing supporting invariants: true 122.60/77.71 Simplify termination arguments: true 122.60/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.71 [2019-03-28 12:36:19,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.71 [2019-03-28 12:36:19,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.71 [2019-03-28 12:36:19,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.71 [2019-03-28 12:36:19,704 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.71 [2019-03-28 12:36:19,705 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.71 [2019-03-28 12:36:19,705 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.71 [2019-03-28 12:36:19,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.71 [2019-03-28 12:36:19,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.71 Number of strict supporting invariants: 0 122.60/77.71 Number of non-strict supporting invariants: 1 122.60/77.71 Consider only non-deceasing supporting invariants: true 122.60/77.71 Simplify termination arguments: true 122.60/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.71 [2019-03-28 12:36:19,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.71 [2019-03-28 12:36:19,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.71 [2019-03-28 12:36:19,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.71 [2019-03-28 12:36:19,708 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.71 [2019-03-28 12:36:19,709 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.71 [2019-03-28 12:36:19,709 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.71 [2019-03-28 12:36:19,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.71 [2019-03-28 12:36:19,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.71 Number of strict supporting invariants: 0 122.60/77.71 Number of non-strict supporting invariants: 1 122.60/77.71 Consider only non-deceasing supporting invariants: true 122.60/77.71 Simplify termination arguments: true 122.60/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.71 [2019-03-28 12:36:19,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.71 [2019-03-28 12:36:19,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.71 [2019-03-28 12:36:19,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.71 [2019-03-28 12:36:19,716 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.71 [2019-03-28 12:36:19,717 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.71 [2019-03-28 12:36:19,717 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.71 [2019-03-28 12:36:19,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.71 [2019-03-28 12:36:19,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.71 Number of strict supporting invariants: 0 122.60/77.71 Number of non-strict supporting invariants: 1 122.60/77.71 Consider only non-deceasing supporting invariants: true 122.60/77.71 Simplify termination arguments: true 122.60/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.71 [2019-03-28 12:36:19,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.71 [2019-03-28 12:36:19,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.71 [2019-03-28 12:36:19,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.71 [2019-03-28 12:36:19,719 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.71 [2019-03-28 12:36:19,720 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.71 [2019-03-28 12:36:19,720 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.71 [2019-03-28 12:36:19,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.71 [2019-03-28 12:36:19,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.71 Number of strict supporting invariants: 0 122.60/77.71 Number of non-strict supporting invariants: 1 122.60/77.71 Consider only non-deceasing supporting invariants: true 122.60/77.71 Simplify termination arguments: true 122.60/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.71 [2019-03-28 12:36:19,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.71 [2019-03-28 12:36:19,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.71 [2019-03-28 12:36:19,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.71 [2019-03-28 12:36:19,723 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.71 [2019-03-28 12:36:19,724 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.71 [2019-03-28 12:36:19,724 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.71 [2019-03-28 12:36:19,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.71 [2019-03-28 12:36:19,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.71 Number of strict supporting invariants: 0 122.60/77.71 Number of non-strict supporting invariants: 1 122.60/77.71 Consider only non-deceasing supporting invariants: true 122.60/77.71 Simplify termination arguments: true 122.60/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.71 [2019-03-28 12:36:19,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.71 [2019-03-28 12:36:19,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.71 [2019-03-28 12:36:19,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.71 [2019-03-28 12:36:19,728 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.71 [2019-03-28 12:36:19,729 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.71 [2019-03-28 12:36:19,729 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.71 [2019-03-28 12:36:19,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.71 [2019-03-28 12:36:19,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.71 Number of strict supporting invariants: 0 122.60/77.71 Number of non-strict supporting invariants: 1 122.60/77.71 Consider only non-deceasing supporting invariants: true 122.60/77.71 Simplify termination arguments: true 122.60/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.71 [2019-03-28 12:36:19,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.71 [2019-03-28 12:36:19,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.71 [2019-03-28 12:36:19,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.71 [2019-03-28 12:36:19,731 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.71 [2019-03-28 12:36:19,732 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.71 [2019-03-28 12:36:19,732 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.71 [2019-03-28 12:36:19,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.71 [2019-03-28 12:36:19,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.71 Number of strict supporting invariants: 0 122.60/77.71 Number of non-strict supporting invariants: 1 122.60/77.71 Consider only non-deceasing supporting invariants: true 122.60/77.71 Simplify termination arguments: true 122.60/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.71 [2019-03-28 12:36:19,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.71 [2019-03-28 12:36:19,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.71 [2019-03-28 12:36:19,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.71 [2019-03-28 12:36:19,737 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.71 [2019-03-28 12:36:19,738 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.71 [2019-03-28 12:36:19,739 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.71 [2019-03-28 12:36:19,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.71 [2019-03-28 12:36:19,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.71 Number of strict supporting invariants: 0 122.60/77.71 Number of non-strict supporting invariants: 1 122.60/77.71 Consider only non-deceasing supporting invariants: true 122.60/77.71 Simplify termination arguments: true 122.60/77.71 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.71 [2019-03-28 12:36:19,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.71 [2019-03-28 12:36:19,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.71 [2019-03-28 12:36:19,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.71 [2019-03-28 12:36:19,745 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.71 [2019-03-28 12:36:19,747 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.71 [2019-03-28 12:36:19,747 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.71 [2019-03-28 12:36:19,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.71 [2019-03-28 12:36:19,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.71 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.71 Number of strict supporting invariants: 0 122.60/77.71 Number of non-strict supporting invariants: 1 122.60/77.71 Consider only non-deceasing supporting invariants: true 122.60/77.71 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,755 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,756 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,756 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:19,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,758 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,758 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:19,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,760 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,760 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,762 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,763 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,763 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:19,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,765 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,765 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:19,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,767 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,767 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:19,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,769 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,769 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:19,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,771 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,771 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:19,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,773 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,773 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:19,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,774 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,775 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,775 INFO L497 LassoAnalysis]: Using template '3-nested'. 122.60/77.72 [2019-03-28 12:36:19,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:19,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,776 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,777 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,778 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,779 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,779 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,782 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,785 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,785 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,810 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,811 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,811 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,814 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,816 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,816 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,824 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,825 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,825 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,828 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,829 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,829 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,833 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,834 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,834 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,838 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,839 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,839 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,842 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,843 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,843 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,849 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,851 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,851 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,859 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,861 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,861 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,870 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,871 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,871 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:19,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,874 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,875 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:19,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,877 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,877 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,878 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,879 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,879 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:19,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,882 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,883 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:19,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,885 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,885 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:19,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,887 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,887 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:19,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,889 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,889 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:19,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,891 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,891 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:19,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,893 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,894 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,895 INFO L497 LassoAnalysis]: Using template '4-nested'. 122.60/77.72 [2019-03-28 12:36:19,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:19,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,896 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,896 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,898 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,899 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,899 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,902 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,906 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,907 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,937 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,938 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,938 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,942 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,944 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,944 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,955 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,956 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,956 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,960 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,961 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:19,961 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:19,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:19,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:19,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:19,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:19,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:19,966 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:19,967 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,054 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:20,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,059 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,060 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,060 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:20,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,064 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,066 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,066 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:20,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,073 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,075 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,075 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:20,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,085 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,087 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,087 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:20,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,098 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,100 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,100 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:20,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:20,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,103 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,104 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:20,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:20,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,106 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,106 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:20,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,108 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,109 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,109 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:20,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:20,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,112 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,112 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:20,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:20,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,114 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,114 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:20,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:20,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,116 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,117 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:20,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:20,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,118 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,119 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:20,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:20,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,120 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,121 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.72 [2019-03-28 12:36:20,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:20,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,123 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,123 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,124 INFO L497 LassoAnalysis]: Using template '2-phase'. 122.60/77.72 [2019-03-28 12:36:20,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,125 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,125 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.72 [2019-03-28 12:36:20,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:20,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,125 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,126 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,127 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,127 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.72 [2019-03-28 12:36:20,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,128 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,129 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,129 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,132 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,132 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.72 [2019-03-28 12:36:20,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,132 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,135 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,135 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,220 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,220 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.72 [2019-03-28 12:36:20,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,221 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,222 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,222 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,225 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,225 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.72 [2019-03-28 12:36:20,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,225 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,227 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,227 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,234 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,235 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.72 [2019-03-28 12:36:20,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,235 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,236 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,236 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,239 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,239 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.72 [2019-03-28 12:36:20,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,239 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,240 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,240 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,243 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,244 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.72 [2019-03-28 12:36:20,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,244 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,245 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,245 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,249 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,249 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.72 [2019-03-28 12:36:20,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,249 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,250 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,250 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,253 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,253 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.72 [2019-03-28 12:36:20,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,254 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,255 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,255 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,260 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,260 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.72 [2019-03-28 12:36:20,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,261 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,262 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,262 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,270 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,270 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.72 [2019-03-28 12:36:20,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,271 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,273 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,273 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,281 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,281 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.72 [2019-03-28 12:36:20,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,282 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,283 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,283 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,286 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,286 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.72 [2019-03-28 12:36:20,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:20,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,286 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,287 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,288 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,288 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.72 [2019-03-28 12:36:20,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:20,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,289 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,289 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,291 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,291 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.72 [2019-03-28 12:36:20,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,291 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,292 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,292 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,295 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,295 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.72 [2019-03-28 12:36:20,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:20,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,295 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,296 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,297 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,297 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.72 [2019-03-28 12:36:20,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:20,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,298 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,298 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,300 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,300 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.72 [2019-03-28 12:36:20,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:20,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,300 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,301 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,302 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,302 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.72 [2019-03-28 12:36:20,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:20,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,303 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,303 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,304 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,304 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.72 [2019-03-28 12:36:20,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:20,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,305 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,305 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,307 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,307 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.72 [2019-03-28 12:36:20,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:20,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,307 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,308 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,309 INFO L497 LassoAnalysis]: Using template '3-phase'. 122.60/77.72 [2019-03-28 12:36:20,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,309 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,309 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.72 [2019-03-28 12:36:20,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:20,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,310 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,310 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,312 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,312 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.72 [2019-03-28 12:36:20,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,313 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,314 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,314 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,317 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,318 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.72 [2019-03-28 12:36:20,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,318 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,322 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,322 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,483 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,483 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.72 [2019-03-28 12:36:20,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,484 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,485 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,485 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,489 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,489 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.72 [2019-03-28 12:36:20,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,489 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,491 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,492 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,503 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,503 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.72 [2019-03-28 12:36:20,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,503 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,504 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,505 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,508 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,508 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.72 [2019-03-28 12:36:20,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,509 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,510 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,510 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,514 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,515 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.72 [2019-03-28 12:36:20,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,515 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,516 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,516 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,522 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,522 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.72 [2019-03-28 12:36:20,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,522 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,523 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,523 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,527 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,527 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.72 [2019-03-28 12:36:20,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,527 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,529 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,529 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,536 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,536 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.72 [2019-03-28 12:36:20,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,537 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,539 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,539 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,552 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,553 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.72 [2019-03-28 12:36:20,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,553 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,555 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,556 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,568 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,568 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.72 [2019-03-28 12:36:20,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,569 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,570 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,570 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,573 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,574 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.72 [2019-03-28 12:36:20,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:20,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,574 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,575 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,577 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,577 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.72 [2019-03-28 12:36:20,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:20,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,578 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,578 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,580 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,580 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.72 [2019-03-28 12:36:20,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,581 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,582 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,582 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,585 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,585 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.72 [2019-03-28 12:36:20,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:20,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,586 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,586 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,588 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,588 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.72 [2019-03-28 12:36:20,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:20,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,589 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,589 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,591 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,591 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.72 [2019-03-28 12:36:20,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:20,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,592 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,593 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,594 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,594 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.72 [2019-03-28 12:36:20,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:20,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,595 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,595 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,597 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,597 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.72 [2019-03-28 12:36:20,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:20,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,598 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,599 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,600 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,601 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.72 [2019-03-28 12:36:20,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:20,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,601 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,602 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,603 INFO L497 LassoAnalysis]: Using template '4-phase'. 122.60/77.72 [2019-03-28 12:36:20,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,604 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,604 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.72 [2019-03-28 12:36:20,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:20,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,604 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,605 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,607 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,607 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.72 [2019-03-28 12:36:20,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,607 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,609 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,609 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:20,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:20,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:20,615 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:20,615 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.72 [2019-03-28 12:36:20,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:20,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:20,615 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:20,621 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:20,621 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:21,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:21,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:21,194 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:21,194 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.72 [2019-03-28 12:36:21,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:21,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:21,194 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:21,196 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:21,196 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:21,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:21,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:21,201 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:21,202 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.72 [2019-03-28 12:36:21,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:21,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:21,202 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:21,205 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:21,205 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:21,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:21,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:21,221 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:21,221 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.72 [2019-03-28 12:36:21,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:21,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:21,221 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:21,223 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:21,223 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:21,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:21,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:21,228 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:21,228 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.72 [2019-03-28 12:36:21,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:21,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:21,229 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:21,230 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:21,230 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:21,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:21,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:21,236 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:21,236 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.72 [2019-03-28 12:36:21,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:21,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:21,237 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:21,238 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:21,239 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:21,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:21,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:21,245 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:21,246 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.72 [2019-03-28 12:36:21,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:21,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:21,246 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:21,247 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:21,248 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:21,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:21,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:21,253 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:21,253 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.72 [2019-03-28 12:36:21,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:21,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:21,253 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:21,255 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:21,255 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:21,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:21,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:21,265 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:21,265 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.72 [2019-03-28 12:36:21,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:21,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:21,265 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:21,268 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:21,268 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:21,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:21,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:21,282 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:21,282 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.72 [2019-03-28 12:36:21,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:21,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:21,283 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:21,286 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:21,287 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:21,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:21,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:21,304 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:21,304 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.72 [2019-03-28 12:36:21,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:21,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:21,304 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:21,306 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:21,306 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:21,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:21,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:21,311 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:21,311 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.72 [2019-03-28 12:36:21,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:21,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:21,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:21,312 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:21,313 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:21,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:21,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:21,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:21,315 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:21,315 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.72 [2019-03-28 12:36:21,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:21,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:21,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:21,315 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:21,316 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:21,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:21,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:21,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:21,318 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:21,318 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.72 [2019-03-28 12:36:21,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:21,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:21,318 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:21,320 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:21,320 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:21,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:21,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:21,325 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:21,325 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.72 [2019-03-28 12:36:21,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:21,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:21,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:21,326 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:21,326 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:21,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:21,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:21,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:21,328 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:21,328 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.72 [2019-03-28 12:36:21,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:21,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:21,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:21,329 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:21,329 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:21,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:21,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:21,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:21,331 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:21,331 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.72 [2019-03-28 12:36:21,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:21,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:21,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:21,332 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:21,332 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:21,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:21,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:21,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:21,334 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:21,334 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.72 [2019-03-28 12:36:21,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:21,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:21,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:21,335 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:21,336 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:21,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:21,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:21,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:21,337 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:21,337 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.72 [2019-03-28 12:36:21,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:21,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:21,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:21,338 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:21,339 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:21,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:21,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:21,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:21,340 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:21,341 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.72 [2019-03-28 12:36:21,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:21,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:21,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:21,341 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.72 [2019-03-28 12:36:21,342 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:21,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:21,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:21,343 INFO L497 LassoAnalysis]: Using template '2-lex'. 122.60/77.72 [2019-03-28 12:36:21,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:21,344 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:21,344 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.72 [2019-03-28 12:36:21,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.72 [2019-03-28 12:36:21,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:21,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:21,344 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:21,345 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:21,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:21,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:21,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:21,347 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:21,347 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.72 [2019-03-28 12:36:21,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:21,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:21,347 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:21,348 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:21,348 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:21,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:21,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:21,352 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:21,352 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.72 [2019-03-28 12:36:21,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:21,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:21,352 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:21,355 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:21,356 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:21,440 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:21,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:21,441 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:21,441 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.72 [2019-03-28 12:36:21,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:21,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:21,441 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:21,442 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:21,442 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:21,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:21,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:21,446 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:21,446 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.72 [2019-03-28 12:36:21,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:21,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:21,446 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:21,448 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:21,448 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:21,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:21,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:21,457 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:21,457 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.72 [2019-03-28 12:36:21,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:21,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:21,457 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:21,458 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:21,458 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:21,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:21,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:21,462 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:21,462 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.72 [2019-03-28 12:36:21,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:21,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:21,462 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:21,463 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:21,463 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:21,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:21,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:21,467 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:21,467 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.72 [2019-03-28 12:36:21,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:21,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:21,467 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:21,468 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:21,469 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:21,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:21,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:21,473 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:21,473 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.72 [2019-03-28 12:36:21,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:21,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:21,473 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:21,474 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.72 [2019-03-28 12:36:21,474 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.72 [2019-03-28 12:36:21,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.72 [2019-03-28 12:36:21,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.72 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.72 Number of strict supporting invariants: 0 122.60/77.72 Number of non-strict supporting invariants: 1 122.60/77.72 Consider only non-deceasing supporting invariants: true 122.60/77.72 Simplify termination arguments: true 122.60/77.72 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.72 [2019-03-28 12:36:21,478 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.72 [2019-03-28 12:36:21,478 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.72 [2019-03-28 12:36:21,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.72 [2019-03-28 12:36:21,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.72 [2019-03-28 12:36:21,478 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.72 [2019-03-28 12:36:21,479 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:21,479 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:21,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:21,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:21,487 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:21,487 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.73 [2019-03-28 12:36:21,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:21,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:21,488 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.73 [2019-03-28 12:36:21,489 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:21,490 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:21,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:21,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:21,501 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:21,501 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.73 [2019-03-28 12:36:21,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:21,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:21,502 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.73 [2019-03-28 12:36:21,503 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:21,503 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:21,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:21,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:21,516 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:21,516 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.73 [2019-03-28 12:36:21,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:21,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:21,516 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.73 [2019-03-28 12:36:21,517 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:21,517 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:21,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:21,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:21,521 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:21,521 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.73 [2019-03-28 12:36:21,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:21,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:21,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:21,521 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.73 [2019-03-28 12:36:21,522 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:21,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:21,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:21,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:21,524 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:21,524 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.73 [2019-03-28 12:36:21,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:21,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:21,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:21,525 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.73 [2019-03-28 12:36:21,525 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:21,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:21,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:21,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:21,527 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:21,527 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.73 [2019-03-28 12:36:21,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:21,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:21,527 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.73 [2019-03-28 12:36:21,528 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:21,528 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:21,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:21,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:21,532 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:21,532 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.73 [2019-03-28 12:36:21,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:21,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:21,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:21,532 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.73 [2019-03-28 12:36:21,533 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:21,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:21,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:21,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:21,535 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:21,535 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.73 [2019-03-28 12:36:21,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:21,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:21,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:21,535 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.73 [2019-03-28 12:36:21,535 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:21,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:21,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:21,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:21,538 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:21,538 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.73 [2019-03-28 12:36:21,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:21,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:21,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:21,538 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.73 [2019-03-28 12:36:21,538 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:21,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:21,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:21,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:21,540 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:21,541 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.73 [2019-03-28 12:36:21,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:21,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:21,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:21,541 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.73 [2019-03-28 12:36:21,541 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:21,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:21,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:21,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:21,543 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:21,544 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.73 [2019-03-28 12:36:21,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:21,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:21,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:21,544 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.73 [2019-03-28 12:36:21,544 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:21,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:21,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:21,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:21,546 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:21,546 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.73 [2019-03-28 12:36:21,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:21,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:21,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:21,547 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.73 [2019-03-28 12:36:21,547 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:21,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:21,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:21,549 INFO L497 LassoAnalysis]: Using template '3-lex'. 122.60/77.73 [2019-03-28 12:36:21,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:21,549 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:21,550 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.73 [2019-03-28 12:36:21,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:21,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:21,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:21,550 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.73 [2019-03-28 12:36:21,551 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:21,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:21,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:21,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:21,553 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:21,553 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.73 [2019-03-28 12:36:21,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:21,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:21,554 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.73 [2019-03-28 12:36:21,555 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:21,555 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:21,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:21,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:21,560 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:21,560 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.73 [2019-03-28 12:36:21,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:21,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:21,560 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.73 [2019-03-28 12:36:21,565 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:21,565 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:21,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:21,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:21,865 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:21,865 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.73 [2019-03-28 12:36:21,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:21,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:21,866 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.73 [2019-03-28 12:36:21,867 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:21,868 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:21,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:21,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:21,873 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:21,873 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.73 [2019-03-28 12:36:21,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:21,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:21,874 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.73 [2019-03-28 12:36:21,876 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:21,876 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:21,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:21,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:21,891 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:21,891 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.73 [2019-03-28 12:36:21,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:21,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:21,892 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.73 [2019-03-28 12:36:21,893 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:21,894 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:21,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:21,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:21,899 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:21,899 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.73 [2019-03-28 12:36:21,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:21,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:21,899 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.73 [2019-03-28 12:36:21,901 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:21,901 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:21,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:21,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:21,907 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:21,907 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.73 [2019-03-28 12:36:21,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:21,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:21,907 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.73 [2019-03-28 12:36:21,909 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:21,909 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:21,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:21,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:21,916 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:21,916 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.73 [2019-03-28 12:36:21,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:21,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:21,917 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.73 [2019-03-28 12:36:21,918 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:21,918 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:21,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:21,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:21,923 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:21,923 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.73 [2019-03-28 12:36:21,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:21,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:21,924 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.73 [2019-03-28 12:36:21,926 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:21,926 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:21,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:21,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:21,939 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:21,939 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.73 [2019-03-28 12:36:21,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:21,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:21,939 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.73 [2019-03-28 12:36:21,942 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:21,942 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:21,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:21,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:21,963 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:21,963 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.73 [2019-03-28 12:36:21,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:21,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:21,963 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.73 [2019-03-28 12:36:21,966 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:21,967 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:22,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:22,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:22,122 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:22,122 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.73 [2019-03-28 12:36:22,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:22,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:22,122 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.73 [2019-03-28 12:36:22,123 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:22,124 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:22,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:22,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:22,128 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:22,129 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.73 [2019-03-28 12:36:22,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:22,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:22,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:22,129 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.73 [2019-03-28 12:36:22,130 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:22,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:22,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:22,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:22,133 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:22,133 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.73 [2019-03-28 12:36:22,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:22,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:22,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:22,134 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.73 [2019-03-28 12:36:22,134 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:22,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:22,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:22,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:22,137 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:22,137 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.73 [2019-03-28 12:36:22,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:22,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:22,137 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.73 [2019-03-28 12:36:22,138 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:22,138 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:22,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:22,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:22,143 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:22,143 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.73 [2019-03-28 12:36:22,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:22,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:22,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:22,144 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.73 [2019-03-28 12:36:22,144 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:22,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:22,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:22,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:22,146 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:22,147 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.73 [2019-03-28 12:36:22,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:22,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:22,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:22,147 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.73 [2019-03-28 12:36:22,148 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:22,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:22,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:22,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:22,150 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:22,150 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.73 [2019-03-28 12:36:22,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:22,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:22,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:22,151 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.73 [2019-03-28 12:36:22,151 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:22,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:22,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:22,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:22,153 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:22,153 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.73 [2019-03-28 12:36:22,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:22,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:22,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:22,154 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.73 [2019-03-28 12:36:22,154 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:22,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:22,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:22,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:22,157 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:22,157 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.73 [2019-03-28 12:36:22,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:22,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:22,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:22,157 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.73 [2019-03-28 12:36:22,158 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:22,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:22,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:22,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:22,160 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:22,160 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.73 [2019-03-28 12:36:22,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:22,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:22,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:22,161 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.73 [2019-03-28 12:36:22,161 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:22,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:22,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:22,163 INFO L488 BuchiCegarLoop]: Result of lasso check was UNKNOWN. I will concatenate loop to stem and try again. 122.60/77.73 [2019-03-28 12:36:22,164 INFO L794 eck$LassoCheckResult]: Stem: 319#ULTIMATE.startENTRY [150] ULTIMATE.startENTRY-->L36: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~ret8=|v_ULTIMATE.start_main_#t~ret8_4|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~ret8, ULTIMATE.start_main_~length2~0] 320#L36 [102] L36-->L36-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 329#L36-2 [103] L36-2-->L39-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 323#L39-1 [121] L39-1-->L44: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc6.base_2| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc6.base_2| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc6.base_2|)) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc6.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc7.base_2| v_ULTIMATE.start_main_~length2~0_7)) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_2|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_2|, #valid=|v_#valid_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc7.offset] 324#L44 [95] L44-->L44-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 321#L44-1 [151] L44-1-->L22-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= v_ULTIMATE.start_cstrcspn_~s1.offset_4 |v_ULTIMATE.start_cstrcspn_#in~s1.offset_2|) (= v_ULTIMATE.start_cstrcspn_~s1.base_5 v_ULTIMATE.start_cstrcspn_~p~0.base_8) (= |v_ULTIMATE.start_cstrcspn_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= |v_ULTIMATE.start_cstrcspn_#in~s1.base_2| v_ULTIMATE.start_cstrcspn_~s1.base_5) (= |v_ULTIMATE.start_cstrcspn_#in~s2.offset_2| v_ULTIMATE.start_cstrcspn_~s2.offset_4) (= |v_ULTIMATE.start_cstrcspn_#in~s2.base_2| v_ULTIMATE.start_cstrcspn_~s2.base_4) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrcspn_#in~s1.offset_2|) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0))) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_cstrcspn_~s1.offset_4 v_ULTIMATE.start_cstrcspn_~p~0.offset_7) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrcspn_#in~s2.offset_2|) (= |v_ULTIMATE.start_cstrcspn_#in~s2.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_8|, ULTIMATE.start_cstrcspn_#t~post0.base=|v_ULTIMATE.start_cstrcspn_#t~post0.base_7|, ULTIMATE.start_cstrcspn_~s1.offset=v_ULTIMATE.start_cstrcspn_~s1.offset_4, ULTIMATE.start_cstrcspn_~s2.offset=v_ULTIMATE.start_cstrcspn_~s2.offset_4, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrcspn_#t~post0.offset=|v_ULTIMATE.start_cstrcspn_#t~post0.offset_6|, ULTIMATE.start_cstrcspn_#in~s2.base=|v_ULTIMATE.start_cstrcspn_#in~s2.base_2|, ULTIMATE.start_cstrcspn_#in~s1.base=|v_ULTIMATE.start_cstrcspn_#in~s1.base_2|, #length=|v_#length_12|, ULTIMATE.start_cstrcspn_#in~s1.offset=|v_ULTIMATE.start_cstrcspn_#in~s1.offset_2|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_8, ULTIMATE.start_cstrcspn_~spanp~0.offset=v_ULTIMATE.start_cstrcspn_~spanp~0.offset_6, ULTIMATE.start_cstrcspn_~s1.base=v_ULTIMATE.start_cstrcspn_~s1.base_5, ULTIMATE.start_cstrcspn_~s2.base=v_ULTIMATE.start_cstrcspn_~s2.base_4, ULTIMATE.start_cstrcspn_~spanp~0.base=v_ULTIMATE.start_cstrcspn_~spanp~0.base_6, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_7|, ULTIMATE.start_cstrcspn_#t~mem3=|v_ULTIMATE.start_cstrcspn_#t~mem3_6|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrcspn_~p~0.offset=v_ULTIMATE.start_cstrcspn_~p~0.offset_7, ULTIMATE.start_cstrcspn_#t~mem1=|v_ULTIMATE.start_cstrcspn_#t~mem1_5|, ULTIMATE.start_cstrcspn_~p~0.base=v_ULTIMATE.start_cstrcspn_~p~0.base_8, ULTIMATE.start_cstrcspn_#in~s2.offset=|v_ULTIMATE.start_cstrcspn_#in~s2.offset_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrcspn_#res=|v_ULTIMATE.start_cstrcspn_#res_4|, ULTIMATE.start_cstrcspn_~c~0=v_ULTIMATE.start_cstrcspn_~c~0_6} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~post2.base, ULTIMATE.start_cstrcspn_~spanp~0.offset, ULTIMATE.start_cstrcspn_~s1.base, ULTIMATE.start_cstrcspn_~s2.base, ULTIMATE.start_cstrcspn_#t~post0.base, ULTIMATE.start_cstrcspn_~s1.offset, ULTIMATE.start_cstrcspn_~spanp~0.base, ULTIMATE.start_cstrcspn_#t~post2.offset, ULTIMATE.start_cstrcspn_#t~mem3, ULTIMATE.start_cstrcspn_~p~0.offset, ULTIMATE.start_cstrcspn_#t~mem1, ULTIMATE.start_cstrcspn_~p~0.base, ULTIMATE.start_cstrcspn_~s2.offset, ULTIMATE.start_cstrcspn_#in~s2.offset, ULTIMATE.start_cstrcspn_#t~post0.offset, #memory_int, ULTIMATE.start_cstrcspn_#in~s2.base, ULTIMATE.start_cstrcspn_#in~s1.base, ULTIMATE.start_cstrcspn_#in~s1.offset, ULTIMATE.start_cstrcspn_#res, ULTIMATE.start_cstrcspn_~c~0, ULTIMATE.start_cstrcspn_~sc~0] 322#L22-2 [70] L22-2-->L23: Formula: (and (= |v_ULTIMATE.start_cstrcspn_#t~post0.base_2| v_ULTIMATE.start_cstrcspn_~p~0.base_5) (= v_ULTIMATE.start_cstrcspn_~p~0.base_4 |v_ULTIMATE.start_cstrcspn_#t~post0.base_2|) (= |v_ULTIMATE.start_cstrcspn_#t~post0.offset_2| v_ULTIMATE.start_cstrcspn_~p~0.offset_5) (= v_ULTIMATE.start_cstrcspn_~p~0.offset_4 (+ |v_ULTIMATE.start_cstrcspn_#t~post0.offset_2| 1))) InVars {ULTIMATE.start_cstrcspn_~p~0.base=v_ULTIMATE.start_cstrcspn_~p~0.base_5, ULTIMATE.start_cstrcspn_~p~0.offset=v_ULTIMATE.start_cstrcspn_~p~0.offset_5} OutVars{ULTIMATE.start_cstrcspn_#t~post0.offset=|v_ULTIMATE.start_cstrcspn_#t~post0.offset_2|, ULTIMATE.start_cstrcspn_~p~0.base=v_ULTIMATE.start_cstrcspn_~p~0.base_4, ULTIMATE.start_cstrcspn_#t~post0.base=|v_ULTIMATE.start_cstrcspn_#t~post0.base_2|, ULTIMATE.start_cstrcspn_~p~0.offset=v_ULTIMATE.start_cstrcspn_~p~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_~p~0.base, ULTIMATE.start_cstrcspn_#t~post0.offset, ULTIMATE.start_cstrcspn_#t~post0.base, ULTIMATE.start_cstrcspn_~p~0.offset] 327#L23 [152] L23-->L25-3: Formula: (and (<= 0 |v_ULTIMATE.start_cstrcspn_#t~post0.offset_8|) (<= (+ |v_ULTIMATE.start_cstrcspn_#t~post0.offset_8| 1) (select |v_#length_13| |v_ULTIMATE.start_cstrcspn_#t~post0.base_9|)) (= 1 (select |v_#valid_20| |v_ULTIMATE.start_cstrcspn_#t~post0.base_9|)) (= v_ULTIMATE.start_cstrcspn_~s2.base_5 v_ULTIMATE.start_cstrcspn_~spanp~0.base_7) (= v_ULTIMATE.start_cstrcspn_~c~0_7 (select (select |v_#memory_int_9| |v_ULTIMATE.start_cstrcspn_#t~post0.base_9|) |v_ULTIMATE.start_cstrcspn_#t~post0.offset_8|)) (= v_ULTIMATE.start_cstrcspn_~spanp~0.offset_7 v_ULTIMATE.start_cstrcspn_~s2.offset_5)) InVars {ULTIMATE.start_cstrcspn_~s2.offset=v_ULTIMATE.start_cstrcspn_~s2.offset_5, #valid=|v_#valid_20|, ULTIMATE.start_cstrcspn_#t~post0.offset=|v_ULTIMATE.start_cstrcspn_#t~post0.offset_8|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrcspn_~s2.base=v_ULTIMATE.start_cstrcspn_~s2.base_5, #length=|v_#length_13|, ULTIMATE.start_cstrcspn_#t~post0.base=|v_ULTIMATE.start_cstrcspn_#t~post0.base_9|} OutVars{ULTIMATE.start_cstrcspn_~s2.offset=v_ULTIMATE.start_cstrcspn_~s2.offset_5, #valid=|v_#valid_20|, ULTIMATE.start_cstrcspn_~spanp~0.offset=v_ULTIMATE.start_cstrcspn_~spanp~0.offset_7, ULTIMATE.start_cstrcspn_#t~post0.offset=|v_ULTIMATE.start_cstrcspn_#t~post0.offset_7|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrcspn_~s2.base=v_ULTIMATE.start_cstrcspn_~s2.base_5, #length=|v_#length_13|, ULTIMATE.start_cstrcspn_#t~post0.base=|v_ULTIMATE.start_cstrcspn_#t~post0.base_8|, ULTIMATE.start_cstrcspn_~spanp~0.base=v_ULTIMATE.start_cstrcspn_~spanp~0.base_7, ULTIMATE.start_cstrcspn_~c~0=v_ULTIMATE.start_cstrcspn_~c~0_7, ULTIMATE.start_cstrcspn_#t~mem1=|v_ULTIMATE.start_cstrcspn_#t~mem1_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_~spanp~0.offset, ULTIMATE.start_cstrcspn_#t~post0.offset, ULTIMATE.start_cstrcspn_#t~post0.base, ULTIMATE.start_cstrcspn_~spanp~0.base, ULTIMATE.start_cstrcspn_~c~0, ULTIMATE.start_cstrcspn_#t~mem1] 328#L25-3 [73] L25-3-->L26: Formula: (and (= v_ULTIMATE.start_cstrcspn_~spanp~0.base_4 |v_ULTIMATE.start_cstrcspn_#t~post2.base_2|) (= v_ULTIMATE.start_cstrcspn_~spanp~0.offset_4 (+ |v_ULTIMATE.start_cstrcspn_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrcspn_#t~post2.offset_2| v_ULTIMATE.start_cstrcspn_~spanp~0.offset_5) (= |v_ULTIMATE.start_cstrcspn_#t~post2.base_2| v_ULTIMATE.start_cstrcspn_~spanp~0.base_5)) InVars {ULTIMATE.start_cstrcspn_~spanp~0.offset=v_ULTIMATE.start_cstrcspn_~spanp~0.offset_5, ULTIMATE.start_cstrcspn_~spanp~0.base=v_ULTIMATE.start_cstrcspn_~spanp~0.base_5} OutVars{ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_2|, ULTIMATE.start_cstrcspn_~spanp~0.offset=v_ULTIMATE.start_cstrcspn_~spanp~0.offset_4, ULTIMATE.start_cstrcspn_~spanp~0.base=v_ULTIMATE.start_cstrcspn_~spanp~0.base_4, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~post2.base, ULTIMATE.start_cstrcspn_~spanp~0.offset, ULTIMATE.start_cstrcspn_~spanp~0.base, ULTIMATE.start_cstrcspn_#t~post2.offset] 315#L26 [153] L26-->L26-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrcspn_#t~post2.offset_8|) (<= (+ |v_ULTIMATE.start_cstrcspn_#t~post2.offset_8| 1) (select |v_#length_14| |v_ULTIMATE.start_cstrcspn_#t~post2.base_9|)) (= v_ULTIMATE.start_cstrcspn_~sc~0_9 |v_ULTIMATE.start_cstrcspn_#t~mem3_7|) (= (select |v_#valid_21| |v_ULTIMATE.start_cstrcspn_#t~post2.base_9|) 1) (= |v_ULTIMATE.start_cstrcspn_#t~mem3_7| (select (select |v_#memory_int_10| |v_ULTIMATE.start_cstrcspn_#t~post2.base_9|) |v_ULTIMATE.start_cstrcspn_#t~post2.offset_8|))) InVars {ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_8|} OutVars{ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ULTIMATE.start_cstrcspn_#t~mem3=|v_ULTIMATE.start_cstrcspn_#t~mem3_7|, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_8|, ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_9} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~mem3, ULTIMATE.start_cstrcspn_~sc~0] 316#L26-2 [140] L26-2-->L25-1: Formula: (> v_ULTIMATE.start_cstrcspn_~sc~0_5 v_ULTIMATE.start_cstrcspn_~c~0_5) InVars {ULTIMATE.start_cstrcspn_~c~0=v_ULTIMATE.start_cstrcspn_~c~0_5, ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_5} OutVars{ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_7|, ULTIMATE.start_cstrcspn_~c~0=v_ULTIMATE.start_cstrcspn_~c~0_5, ULTIMATE.start_cstrcspn_#t~mem3=|v_ULTIMATE.start_cstrcspn_#t~mem3_5|, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_6|, ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~post2.base, ULTIMATE.start_cstrcspn_#t~mem3, ULTIMATE.start_cstrcspn_#t~post2.offset] 330#L25-1 [148] L25-1-->L25-3: Formula: (< v_ULTIMATE.start_cstrcspn_~sc~0_7 0) InVars {ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_7} OutVars{ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_7} AuxVars[] AssignedVars[] 325#L25-3 [73] L25-3-->L26: Formula: (and (= v_ULTIMATE.start_cstrcspn_~spanp~0.base_4 |v_ULTIMATE.start_cstrcspn_#t~post2.base_2|) (= v_ULTIMATE.start_cstrcspn_~spanp~0.offset_4 (+ |v_ULTIMATE.start_cstrcspn_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrcspn_#t~post2.offset_2| v_ULTIMATE.start_cstrcspn_~spanp~0.offset_5) (= |v_ULTIMATE.start_cstrcspn_#t~post2.base_2| v_ULTIMATE.start_cstrcspn_~spanp~0.base_5)) InVars {ULTIMATE.start_cstrcspn_~spanp~0.offset=v_ULTIMATE.start_cstrcspn_~spanp~0.offset_5, ULTIMATE.start_cstrcspn_~spanp~0.base=v_ULTIMATE.start_cstrcspn_~spanp~0.base_5} OutVars{ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_2|, ULTIMATE.start_cstrcspn_~spanp~0.offset=v_ULTIMATE.start_cstrcspn_~spanp~0.offset_4, ULTIMATE.start_cstrcspn_~spanp~0.base=v_ULTIMATE.start_cstrcspn_~spanp~0.base_4, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~post2.base, ULTIMATE.start_cstrcspn_~spanp~0.offset, ULTIMATE.start_cstrcspn_~spanp~0.base, ULTIMATE.start_cstrcspn_#t~post2.offset] 315#L26 122.60/77.73 [2019-03-28 12:36:22,165 INFO L796 eck$LassoCheckResult]: Loop: 315#L26 [153] L26-->L26-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrcspn_#t~post2.offset_8|) (<= (+ |v_ULTIMATE.start_cstrcspn_#t~post2.offset_8| 1) (select |v_#length_14| |v_ULTIMATE.start_cstrcspn_#t~post2.base_9|)) (= v_ULTIMATE.start_cstrcspn_~sc~0_9 |v_ULTIMATE.start_cstrcspn_#t~mem3_7|) (= (select |v_#valid_21| |v_ULTIMATE.start_cstrcspn_#t~post2.base_9|) 1) (= |v_ULTIMATE.start_cstrcspn_#t~mem3_7| (select (select |v_#memory_int_10| |v_ULTIMATE.start_cstrcspn_#t~post2.base_9|) |v_ULTIMATE.start_cstrcspn_#t~post2.offset_8|))) InVars {ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_8|} OutVars{ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ULTIMATE.start_cstrcspn_#t~mem3=|v_ULTIMATE.start_cstrcspn_#t~mem3_7|, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_8|, ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_9} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~mem3, ULTIMATE.start_cstrcspn_~sc~0] 316#L26-2 [140] L26-2-->L25-1: Formula: (> v_ULTIMATE.start_cstrcspn_~sc~0_5 v_ULTIMATE.start_cstrcspn_~c~0_5) InVars {ULTIMATE.start_cstrcspn_~c~0=v_ULTIMATE.start_cstrcspn_~c~0_5, ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_5} OutVars{ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_7|, ULTIMATE.start_cstrcspn_~c~0=v_ULTIMATE.start_cstrcspn_~c~0_5, ULTIMATE.start_cstrcspn_#t~mem3=|v_ULTIMATE.start_cstrcspn_#t~mem3_5|, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_6|, ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~post2.base, ULTIMATE.start_cstrcspn_#t~mem3, ULTIMATE.start_cstrcspn_#t~post2.offset] 330#L25-1 [148] L25-1-->L25-3: Formula: (< v_ULTIMATE.start_cstrcspn_~sc~0_7 0) InVars {ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_7} OutVars{ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_7} AuxVars[] AssignedVars[] 325#L25-3 [73] L25-3-->L26: Formula: (and (= v_ULTIMATE.start_cstrcspn_~spanp~0.base_4 |v_ULTIMATE.start_cstrcspn_#t~post2.base_2|) (= v_ULTIMATE.start_cstrcspn_~spanp~0.offset_4 (+ |v_ULTIMATE.start_cstrcspn_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrcspn_#t~post2.offset_2| v_ULTIMATE.start_cstrcspn_~spanp~0.offset_5) (= |v_ULTIMATE.start_cstrcspn_#t~post2.base_2| v_ULTIMATE.start_cstrcspn_~spanp~0.base_5)) InVars {ULTIMATE.start_cstrcspn_~spanp~0.offset=v_ULTIMATE.start_cstrcspn_~spanp~0.offset_5, ULTIMATE.start_cstrcspn_~spanp~0.base=v_ULTIMATE.start_cstrcspn_~spanp~0.base_5} OutVars{ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_2|, ULTIMATE.start_cstrcspn_~spanp~0.offset=v_ULTIMATE.start_cstrcspn_~spanp~0.offset_4, ULTIMATE.start_cstrcspn_~spanp~0.base=v_ULTIMATE.start_cstrcspn_~spanp~0.base_4, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~post2.base, ULTIMATE.start_cstrcspn_~spanp~0.offset, ULTIMATE.start_cstrcspn_~spanp~0.base, ULTIMATE.start_cstrcspn_#t~post2.offset] 315#L26 122.60/77.73 [2019-03-28 12:36:22,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.60/77.73 [2019-03-28 12:36:22,165 INFO L82 PathProgramCache]: Analyzing trace with hash -604128316, now seen corresponding path program 2 times 122.60/77.73 [2019-03-28 12:36:22,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.60/77.73 [2019-03-28 12:36:22,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.60/77.73 [2019-03-28 12:36:22,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.60/77.73 [2019-03-28 12:36:22,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 122.60/77.73 [2019-03-28 12:36:22,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.60/77.73 [2019-03-28 12:36:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 122.60/77.73 [2019-03-28 12:36:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 122.60/77.73 [2019-03-28 12:36:22,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.60/77.73 [2019-03-28 12:36:22,183 INFO L82 PathProgramCache]: Analyzing trace with hash 5620745, now seen corresponding path program 3 times 122.60/77.73 [2019-03-28 12:36:22,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.60/77.73 [2019-03-28 12:36:22,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.60/77.73 [2019-03-28 12:36:22,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.60/77.73 [2019-03-28 12:36:22,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 122.60/77.73 [2019-03-28 12:36:22,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.60/77.73 [2019-03-28 12:36:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 122.60/77.73 [2019-03-28 12:36:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 122.60/77.73 [2019-03-28 12:36:22,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 122.60/77.73 [2019-03-28 12:36:22,187 INFO L82 PathProgramCache]: Analyzing trace with hash -340138420, now seen corresponding path program 3 times 122.60/77.73 [2019-03-28 12:36:22,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 122.60/77.73 [2019-03-28 12:36:22,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 122.60/77.73 [2019-03-28 12:36:22,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.60/77.73 [2019-03-28 12:36:22,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 122.60/77.73 [2019-03-28 12:36:22,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 122.60/77.73 [2019-03-28 12:36:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 122.60/77.73 [2019-03-28 12:36:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 122.60/77.73 [2019-03-28 12:36:22,764 WARN L188 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 124 122.60/77.73 [2019-03-28 12:36:22,913 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 98 122.60/77.73 [2019-03-28 12:36:22,916 INFO L216 LassoAnalysis]: Preferences: 122.60/77.73 [2019-03-28 12:36:22,916 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 122.60/77.73 [2019-03-28 12:36:22,916 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 122.60/77.73 [2019-03-28 12:36:22,916 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 122.60/77.73 [2019-03-28 12:36:22,916 INFO L127 ssoRankerPreferences]: Use exernal solver: false 122.60/77.73 [2019-03-28 12:36:22,916 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 122.60/77.73 [2019-03-28 12:36:22,916 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 122.60/77.73 [2019-03-28 12:36:22,917 INFO L130 ssoRankerPreferences]: Path of dumped script: 122.60/77.73 [2019-03-28 12:36:22,917 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso 122.60/77.73 [2019-03-28 12:36:22,917 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 122.60/77.73 [2019-03-28 12:36:22,917 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 122.60/77.73 [2019-03-28 12:36:22,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.60/77.73 [2019-03-28 12:36:22,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.60/77.73 [2019-03-28 12:36:22,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.60/77.73 [2019-03-28 12:36:23,246 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 122.60/77.73 [2019-03-28 12:36:23,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.60/77.73 [2019-03-28 12:36:23,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.60/77.73 [2019-03-28 12:36:23,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.60/77.73 [2019-03-28 12:36:23,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.60/77.73 [2019-03-28 12:36:23,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.60/77.73 [2019-03-28 12:36:23,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.60/77.73 [2019-03-28 12:36:23,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.60/77.73 [2019-03-28 12:36:23,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.60/77.73 [2019-03-28 12:36:23,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 122.60/77.73 [2019-03-28 12:36:23,633 INFO L300 LassoAnalysis]: Preprocessing complete. 122.60/77.73 [2019-03-28 12:36:23,633 INFO L497 LassoAnalysis]: Using template 'affine'. 122.60/77.73 [2019-03-28 12:36:23,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:23,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,637 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,637 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,639 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,641 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,641 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,644 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,644 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,649 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,649 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,652 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,652 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,657 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,657 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,660 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,660 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,664 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,664 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,668 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,669 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,672 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,672 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:23,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,696 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,696 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:23,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:23,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:23,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:23,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:23,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:23,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:23,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,708 INFO L497 LassoAnalysis]: Using template '2-nested'. 122.60/77.73 [2019-03-28 12:36:23,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:23,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,709 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,709 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,710 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,711 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,711 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,713 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,713 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,713 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,715 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,716 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,716 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,717 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,719 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,719 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,725 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,726 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,726 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,728 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,729 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,730 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,736 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,736 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,736 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,738 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,739 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,739 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,743 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,744 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,744 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,750 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,751 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,751 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,753 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,755 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,755 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:23,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,778 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,779 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,780 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,781 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,781 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:23,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,783 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,783 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:23,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,784 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,784 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:23,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,786 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,786 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:23,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,788 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,788 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:23,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,789 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,790 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:23,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,791 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,791 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:23,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,793 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,793 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,794 INFO L497 LassoAnalysis]: Using template '3-nested'. 122.60/77.73 [2019-03-28 12:36:23,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:23,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,795 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,795 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,796 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,797 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,797 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,799 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,800 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,800 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,803 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,803 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,803 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,806 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,807 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,808 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,816 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,816 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,816 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,820 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,821 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,821 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,829 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,830 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,830 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,833 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,834 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,834 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,839 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,841 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,841 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,848 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,849 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,849 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,852 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,855 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,855 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:23,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,889 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,889 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,890 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,891 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,891 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:23,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,894 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,894 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:23,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,895 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,896 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:23,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,897 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,897 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:23,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,899 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,899 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:23,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,901 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,901 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:23,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,902 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,903 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:23,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,904 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,904 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,905 INFO L497 LassoAnalysis]: Using template '4-nested'. 122.60/77.73 [2019-03-28 12:36:23,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:23,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,906 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,907 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,908 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,909 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,909 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,911 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,912 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,912 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,915 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,916 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,916 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,918 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,920 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,920 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,930 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,931 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,931 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,935 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,936 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,936 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,946 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,947 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,947 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,950 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,951 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,951 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,957 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,958 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,959 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,967 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,968 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,968 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:23,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:23,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:23,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:23,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:23,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:23,971 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.73 [2019-03-28 12:36:23,975 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:23,975 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:24,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:24,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:24,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:24,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:24,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:24,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:24,011 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.73 [2019-03-28 12:36:24,011 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:24,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:24,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:24,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:24,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:24,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:24,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:24,013 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.73 [2019-03-28 12:36:24,013 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:24,014 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:24,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:24,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:24,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:24,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:24,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:24,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:24,016 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.73 [2019-03-28 12:36:24,017 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:24,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:24,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:24,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:24,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:24,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:24,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:24,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:24,018 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.73 [2019-03-28 12:36:24,019 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:24,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:24,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:24,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:24,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:24,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:24,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:24,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:24,020 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.73 [2019-03-28 12:36:24,020 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:24,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:24,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:24,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:24,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:24,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:24,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:24,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:24,022 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.73 [2019-03-28 12:36:24,023 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:24,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:24,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:24,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:24,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:24,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:24,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:24,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:24,024 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.73 [2019-03-28 12:36:24,025 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:24,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:24,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:24,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:24,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:24,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:24,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:24,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:24,026 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.73 [2019-03-28 12:36:24,026 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:24,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:24,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:24,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:24,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. 122.60/77.73 [2019-03-28 12:36:24,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:24,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:24,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:24,028 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.73 [2019-03-28 12:36:24,028 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:24,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:24,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:24,029 INFO L497 LassoAnalysis]: Using template '2-phase'. 122.60/77.73 [2019-03-28 12:36:24,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:24,030 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:24,030 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.73 [2019-03-28 12:36:24,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.73 [2019-03-28 12:36:24,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:24,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:24,030 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.73 [2019-03-28 12:36:24,031 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:24,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:24,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:24,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:24,032 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:24,032 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.73 [2019-03-28 12:36:24,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:24,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:24,032 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.73 [2019-03-28 12:36:24,033 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:24,033 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:24,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:24,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:24,036 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:24,036 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.73 [2019-03-28 12:36:24,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:24,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:24,036 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.73 [2019-03-28 12:36:24,037 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:24,037 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:24,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:24,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:24,039 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:24,039 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.73 [2019-03-28 12:36:24,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:24,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:24,040 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.73 [2019-03-28 12:36:24,041 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:24,041 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:24,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:24,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:24,043 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:24,043 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.73 [2019-03-28 12:36:24,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:24,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:24,044 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.73 [2019-03-28 12:36:24,045 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:24,045 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:24,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:24,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:24,052 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:24,052 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.73 [2019-03-28 12:36:24,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:24,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:24,053 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.73 [2019-03-28 12:36:24,054 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:24,054 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:24,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:24,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:24,056 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:24,057 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.73 [2019-03-28 12:36:24,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:24,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:24,057 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.73 [2019-03-28 12:36:24,058 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.73 [2019-03-28 12:36:24,058 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.73 [2019-03-28 12:36:24,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.73 [2019-03-28 12:36:24,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.73 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.73 Number of strict supporting invariants: 0 122.60/77.73 Number of non-strict supporting invariants: 1 122.60/77.73 Consider only non-deceasing supporting invariants: true 122.60/77.73 Simplify termination arguments: true 122.60/77.73 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.73 [2019-03-28 12:36:24,066 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.73 [2019-03-28 12:36:24,066 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.73 [2019-03-28 12:36:24,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.73 [2019-03-28 12:36:24,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.73 [2019-03-28 12:36:24,066 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.73 [2019-03-28 12:36:24,067 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,067 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,069 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,070 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.74 [2019-03-28 12:36:24,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,070 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,071 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,071 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,076 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,076 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.74 [2019-03-28 12:36:24,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,076 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,077 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,078 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,084 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,084 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.74 [2019-03-28 12:36:24,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,085 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,086 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,086 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,089 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,089 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.74 [2019-03-28 12:36:24,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,089 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,092 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,092 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,173 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,173 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.74 [2019-03-28 12:36:24,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:24,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,174 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,174 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,175 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,175 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.74 [2019-03-28 12:36:24,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,176 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,176 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,177 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,179 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,179 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.74 [2019-03-28 12:36:24,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:24,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,180 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,180 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,181 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,182 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.74 [2019-03-28 12:36:24,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:24,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,182 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,182 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,184 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,184 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.74 [2019-03-28 12:36:24,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:24,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,184 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,185 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,186 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,186 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.74 [2019-03-28 12:36:24,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:24,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,186 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,187 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,188 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,188 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.74 [2019-03-28 12:36:24,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:24,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,189 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,189 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,190 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,190 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.74 [2019-03-28 12:36:24,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:24,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,318 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,319 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,320 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,320 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.74 [2019-03-28 12:36:24,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:24,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,321 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,321 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,322 INFO L497 LassoAnalysis]: Using template '3-phase'. 122.60/77.74 [2019-03-28 12:36:24,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,322 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,322 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.74 [2019-03-28 12:36:24,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:24,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,323 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,323 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,325 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,325 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.74 [2019-03-28 12:36:24,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,326 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,327 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,327 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,330 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,330 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.74 [2019-03-28 12:36:24,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,330 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,331 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,331 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,334 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,335 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.74 [2019-03-28 12:36:24,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,335 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,336 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,336 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,339 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,339 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.74 [2019-03-28 12:36:24,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,340 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,342 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,342 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,353 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,353 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.74 [2019-03-28 12:36:24,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,353 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,354 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,354 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,358 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,359 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.74 [2019-03-28 12:36:24,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,359 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,361 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,361 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,371 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,371 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.74 [2019-03-28 12:36:24,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,372 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,373 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,373 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,376 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,376 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.74 [2019-03-28 12:36:24,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,376 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,377 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,378 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,384 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,384 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.74 [2019-03-28 12:36:24,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,385 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,386 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,386 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,396 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,396 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.74 [2019-03-28 12:36:24,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,396 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,397 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,397 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,401 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,401 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.74 [2019-03-28 12:36:24,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,402 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,405 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,405 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,682 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,682 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.74 [2019-03-28 12:36:24,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:24,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,683 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,683 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,685 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,685 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.74 [2019-03-28 12:36:24,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,685 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,686 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,686 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,690 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,690 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.74 [2019-03-28 12:36:24,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:24,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,690 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,691 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,692 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,692 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.74 [2019-03-28 12:36:24,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:24,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,693 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,693 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,695 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,695 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.74 [2019-03-28 12:36:24,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:24,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,696 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,696 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,698 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,698 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.74 [2019-03-28 12:36:24,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:24,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,698 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,699 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,700 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,701 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.74 [2019-03-28 12:36:24,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:24,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,701 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,701 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,703 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,703 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.74 [2019-03-28 12:36:24,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:24,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,704 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,704 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,706 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,706 INFO L339 nArgumentSynthesizer]: Template has degree 2. 122.60/77.74 [2019-03-28 12:36:24,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:24,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,706 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,707 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,708 INFO L497 LassoAnalysis]: Using template '4-phase'. 122.60/77.74 [2019-03-28 12:36:24,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,708 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,708 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:24,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:24,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,709 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,710 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,711 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,711 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:24,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,712 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,713 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,713 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,718 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,718 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:24,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,719 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,720 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,720 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,725 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,725 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:24,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,726 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,727 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,727 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,732 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,732 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:24,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,733 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,735 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,736 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,751 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,751 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:24,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,752 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,753 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,753 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,759 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,759 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:24,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,759 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,762 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,762 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,779 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,779 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:24,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,780 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,781 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,781 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,786 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,786 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:24,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,786 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,788 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,788 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,797 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,797 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:24,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,797 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,800 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,800 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,813 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,813 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:24,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,814 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,815 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,816 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:24,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:24,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:24,822 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:24,822 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:24,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:24,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:24,822 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.74 [2019-03-28 12:36:24,828 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:24,828 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,541 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,541 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:25,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:25,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,542 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,542 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,544 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,544 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:25,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,544 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,546 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,546 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,551 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,551 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:25,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:25,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,551 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,552 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,554 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,554 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:25,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:25,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,554 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,555 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,556 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,556 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:25,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:25,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,557 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,558 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,559 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,559 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:25,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:25,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,560 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,560 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,562 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,562 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:25,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:25,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,562 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,563 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,564 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,565 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:25,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:25,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,565 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,566 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,567 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,567 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:25,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:25,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,568 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,568 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,569 INFO L497 LassoAnalysis]: Using template '2-lex'. 122.60/77.74 [2019-03-28 12:36:25,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,570 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,570 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.74 [2019-03-28 12:36:25,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:25,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,571 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,571 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,573 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,573 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.74 [2019-03-28 12:36:25,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,573 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,574 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,574 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,577 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,577 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.74 [2019-03-28 12:36:25,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,577 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,578 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,578 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,581 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,581 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.74 [2019-03-28 12:36:25,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,582 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,582 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,582 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,585 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,585 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.74 [2019-03-28 12:36:25,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,586 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,587 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,587 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,598 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,598 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.74 [2019-03-28 12:36:25,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,599 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,599 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,599 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,603 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,603 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.74 [2019-03-28 12:36:25,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,603 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,605 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,605 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,617 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,617 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.74 [2019-03-28 12:36:25,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,617 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,618 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,618 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,621 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,621 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.74 [2019-03-28 12:36:25,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,621 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,622 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,623 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,629 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,629 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.74 [2019-03-28 12:36:25,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,629 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,630 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,631 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,638 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,638 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.74 [2019-03-28 12:36:25,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,638 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,639 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,639 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,643 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,643 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.74 [2019-03-28 12:36:25,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,644 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,646 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,646 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,761 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,761 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.74 [2019-03-28 12:36:25,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:25,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,762 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,762 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,764 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,764 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.74 [2019-03-28 12:36:25,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,764 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,765 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,765 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,768 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,768 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.74 [2019-03-28 12:36:25,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:25,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,769 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,769 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,771 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,771 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.74 [2019-03-28 12:36:25,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:25,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,772 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,772 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,774 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,774 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.74 [2019-03-28 12:36:25,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:25,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,774 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,775 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,776 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,776 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.74 [2019-03-28 12:36:25,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:25,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,777 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,777 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,779 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,779 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.74 [2019-03-28 12:36:25,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:25,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,780 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,780 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,782 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,782 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.74 [2019-03-28 12:36:25,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:25,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,782 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,783 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,784 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,784 INFO L339 nArgumentSynthesizer]: Template has degree 1. 122.60/77.74 [2019-03-28 12:36:25,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:25,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,785 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,785 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,787 INFO L497 LassoAnalysis]: Using template '3-lex'. 122.60/77.74 [2019-03-28 12:36:25,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,787 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,787 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:25,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:25,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,788 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,788 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,790 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,791 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:25,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,791 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,792 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,792 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,796 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,796 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:25,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,797 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,798 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,798 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,802 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,802 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:25,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,802 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,803 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,803 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,807 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,807 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:25,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,808 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,810 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,810 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,834 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,834 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:25,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,834 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,835 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,836 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,840 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,840 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:25,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,840 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,843 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,843 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,877 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,877 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:25,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,877 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,878 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,878 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,882 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,882 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:25,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,883 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,884 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,885 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,894 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,894 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:25,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,895 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,896 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,897 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,908 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,908 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:25,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,908 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,910 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,910 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:25,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:25,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:25,915 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:25,915 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:25,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:25,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:25,915 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.74 [2019-03-28 12:36:25,920 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:25,920 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:26,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:26,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:26,254 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:26,254 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:26,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:26,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:26,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:26,255 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.74 [2019-03-28 12:36:26,255 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:26,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:26,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:26,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:26,258 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:26,258 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:26,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:26,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:26,258 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.74 [2019-03-28 12:36:26,259 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:26,259 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:26,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:26,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:26,263 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:26,263 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:26,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:26,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:26,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:26,264 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.74 [2019-03-28 12:36:26,264 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:26,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:26,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:26,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:26,266 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:26,267 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:26,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:26,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:26,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:26,267 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.74 [2019-03-28 12:36:26,268 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:26,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:26,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:26,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:26,270 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:26,270 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:26,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:26,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:26,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:26,270 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.74 [2019-03-28 12:36:26,271 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:26,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:26,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:26,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:26,274 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:26,274 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:26,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:26,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:26,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:26,274 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.74 [2019-03-28 12:36:26,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:26,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:26,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:26,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:26,277 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:26,277 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:26,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:26,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:26,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:26,277 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.74 [2019-03-28 12:36:26,278 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:26,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:26,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:26,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:26,280 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:26,280 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:26,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:26,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:26,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:26,281 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.74 [2019-03-28 12:36:26,281 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:26,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:26,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:26,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 122.60/77.74 Termination analysis: LINEAR_WITH_GUESSES 122.60/77.74 Number of strict supporting invariants: 0 122.60/77.74 Number of non-strict supporting invariants: 1 122.60/77.74 Consider only non-deceasing supporting invariants: true 122.60/77.74 Simplify termination arguments: true 122.60/77.74 Simplify supporting invariants: trueOverapproximate stem: false 122.60/77.74 [2019-03-28 12:36:26,283 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 122.60/77.74 [2019-03-28 12:36:26,283 INFO L339 nArgumentSynthesizer]: Template has degree 3. 122.60/77.74 [2019-03-28 12:36:26,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 122.60/77.74 [2019-03-28 12:36:26,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 122.60/77.74 [2019-03-28 12:36:26,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 122.60/77.74 [2019-03-28 12:36:26,284 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 122.60/77.74 [2019-03-28 12:36:26,284 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 122.60/77.74 [2019-03-28 12:36:26,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 122.60/77.74 [2019-03-28 12:36:26,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 122.60/77.74 [2019-03-28 12:36:26,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:36:26 BasicIcfg 122.60/77.74 [2019-03-28 12:36:26,293 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 122.60/77.74 [2019-03-28 12:36:26,293 INFO L168 Benchmark]: Toolchain (without parser) took 73258.44 ms. Allocated memory was 649.6 MB in the beginning and 1.4 GB in the end (delta: 726.1 MB). Free memory was 564.9 MB in the beginning and 602.1 MB in the end (delta: -37.2 MB). Peak memory consumption was 961.2 MB. Max. memory is 50.3 GB. 122.60/77.74 [2019-03-28 12:36:26,294 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 122.60/77.74 [2019-03-28 12:36:26,294 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.61 ms. Allocated memory was 649.6 MB in the beginning and 679.0 MB in the end (delta: 29.4 MB). Free memory was 563.8 MB in the beginning and 646.5 MB in the end (delta: -82.7 MB). Peak memory consumption was 31.8 MB. Max. memory is 50.3 GB. 122.60/77.74 [2019-03-28 12:36:26,295 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.07 ms. Allocated memory is still 679.0 MB. Free memory was 646.5 MB in the beginning and 642.5 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 50.3 GB. 122.60/77.74 [2019-03-28 12:36:26,295 INFO L168 Benchmark]: Boogie Preprocessor took 29.18 ms. Allocated memory is still 679.0 MB. Free memory was 642.5 MB in the beginning and 640.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. 122.60/77.74 [2019-03-28 12:36:26,295 INFO L168 Benchmark]: RCFGBuilder took 340.03 ms. Allocated memory is still 679.0 MB. Free memory was 640.3 MB in the beginning and 618.2 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 50.3 GB. 122.60/77.74 [2019-03-28 12:36:26,296 INFO L168 Benchmark]: BlockEncodingV2 took 121.51 ms. Allocated memory is still 679.0 MB. Free memory was 618.2 MB in the beginning and 608.4 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. 122.60/77.74 [2019-03-28 12:36:26,296 INFO L168 Benchmark]: TraceAbstraction took 61944.00 ms. Allocated memory was 679.0 MB in the beginning and 1.0 GB in the end (delta: 330.8 MB). Free memory was 608.4 MB in the beginning and 695.3 MB in the end (delta: -86.9 MB). Peak memory consumption was 562.8 MB. Max. memory is 50.3 GB. 122.60/77.74 [2019-03-28 12:36:26,296 INFO L168 Benchmark]: BuchiAutomizer took 10453.70 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 366.0 MB). Free memory was 695.3 MB in the beginning and 602.1 MB in the end (delta: 93.3 MB). Peak memory consumption was 731.5 MB. Max. memory is 50.3 GB. 122.60/77.74 [2019-03-28 12:36:26,301 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 122.60/77.74 --- Results --- 122.60/77.74 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 122.60/77.74 - StatisticsResult: Initial Icfg 122.60/77.74 30 locations, 36 edges 122.60/77.74 - StatisticsResult: Encoded RCFG 122.60/77.74 22 locations, 39 edges 122.60/77.74 * Results from de.uni_freiburg.informatik.ultimate.core: 122.60/77.74 - StatisticsResult: Toolchain Benchmarks 122.60/77.74 Benchmark results are: 122.60/77.74 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 122.60/77.74 * CACSL2BoogieTranslator took 319.61 ms. Allocated memory was 649.6 MB in the beginning and 679.0 MB in the end (delta: 29.4 MB). Free memory was 563.8 MB in the beginning and 646.5 MB in the end (delta: -82.7 MB). Peak memory consumption was 31.8 MB. Max. memory is 50.3 GB. 122.60/77.74 * Boogie Procedure Inliner took 45.07 ms. Allocated memory is still 679.0 MB. Free memory was 646.5 MB in the beginning and 642.5 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 50.3 GB. 122.60/77.74 * Boogie Preprocessor took 29.18 ms. Allocated memory is still 679.0 MB. Free memory was 642.5 MB in the beginning and 640.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. 122.60/77.74 * RCFGBuilder took 340.03 ms. Allocated memory is still 679.0 MB. Free memory was 640.3 MB in the beginning and 618.2 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 50.3 GB. 122.60/77.74 * BlockEncodingV2 took 121.51 ms. Allocated memory is still 679.0 MB. Free memory was 618.2 MB in the beginning and 608.4 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. 122.60/77.74 * TraceAbstraction took 61944.00 ms. Allocated memory was 679.0 MB in the beginning and 1.0 GB in the end (delta: 330.8 MB). Free memory was 608.4 MB in the beginning and 695.3 MB in the end (delta: -86.9 MB). Peak memory consumption was 562.8 MB. Max. memory is 50.3 GB. 122.60/77.74 * BuchiAutomizer took 10453.70 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 366.0 MB). Free memory was 695.3 MB in the beginning and 602.1 MB in the end (delta: 93.3 MB). Peak memory consumption was 731.5 MB. Max. memory is 50.3 GB. 122.60/77.74 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.74 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #length 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.74 unknown boogie variable #memory_int 122.60/77.74 - GenericResult: Unfinished Backtranslation 122.60/77.75 unknown boogie variable #length 122.60/77.75 - GenericResult: Unfinished Backtranslation 122.60/77.75 unknown boogie variable #length 122.60/77.75 - GenericResult: Unfinished Backtranslation 122.60/77.75 unknown boogie variable #memory_int 122.60/77.75 - GenericResult: Unfinished Backtranslation 122.60/77.75 unknown boogie variable #length 122.60/77.75 - GenericResult: Unfinished Backtranslation 122.60/77.75 unknown boogie variable #length 122.60/77.75 - GenericResult: Unfinished Backtranslation 122.60/77.75 unknown boogie variable #length 122.60/77.75 - GenericResult: Unfinished Backtranslation 122.60/77.75 unknown boogie variable #length 122.60/77.75 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 122.60/77.75 - PositiveResult [Line: 26]: pointer dereference always succeeds 122.60/77.75 For all program executions holds that pointer dereference always succeeds at this location 122.60/77.75 - PositiveResult [Line: 44]: pointer dereference always succeeds 122.60/77.75 For all program executions holds that pointer dereference always succeeds at this location 122.60/77.75 - PositiveResult [Line: 26]: pointer dereference always succeeds 122.60/77.75 For all program executions holds that pointer dereference always succeeds at this location 122.60/77.75 - PositiveResult [Line: 45]: pointer dereference always succeeds 122.60/77.75 For all program executions holds that pointer dereference always succeeds at this location 122.60/77.75 - PositiveResult [Line: 45]: pointer dereference always succeeds 122.60/77.75 For all program executions holds that pointer dereference always succeeds at this location 122.60/77.75 - PositiveResult [Line: 23]: pointer dereference always succeeds 122.60/77.75 For all program executions holds that pointer dereference always succeeds at this location 122.60/77.75 - PositiveResult [Line: 44]: pointer dereference always succeeds 122.60/77.75 For all program executions holds that pointer dereference always succeeds at this location 122.60/77.75 - PositiveResult [Line: 23]: pointer dereference always succeeds 122.60/77.75 For all program executions holds that pointer dereference always succeeds at this location 122.60/77.75 - PositiveResult [Line: 27]: pointer arithmetic is always legal 122.60/77.75 For all program executions holds that pointer arithmetic is always legal at this location 122.60/77.75 - AllSpecificationsHoldResult: All specifications hold 122.60/77.75 9 specifications checked. All of them hold 122.60/77.75 - InvariantResult [Line: 25]: Loop Invariant 122.60/77.75 [2019-03-28 12:36:26,312 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,312 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,313 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,313 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,313 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,313 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,314 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,314 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,315 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,315 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,315 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,316 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,316 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,317 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,317 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,318 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,318 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,318 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,319 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,319 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,319 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,320 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,320 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,320 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,320 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,320 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,321 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,321 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,321 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,321 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,322 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,322 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,322 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,322 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,323 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,323 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,323 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,323 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,324 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,324 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,324 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,324 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,325 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,325 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,325 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,325 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,326 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,326 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,326 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,326 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,327 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,327 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,327 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,327 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,327 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,328 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,329 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,329 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,329 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,330 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,330 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,330 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,331 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,331 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,331 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,332 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,332 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,332 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,332 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,333 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,334 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,334 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,334 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,335 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,335 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,335 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,336 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,336 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,336 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,336 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,336 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,337 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,337 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,337 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,337 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,338 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,338 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,338 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,338 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,338 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,339 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,339 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,339 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,339 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,340 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,340 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,340 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,340 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,341 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,341 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,341 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,342 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,342 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,342 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,342 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,343 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,343 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,343 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,343 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,343 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,343 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,344 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 Derived loop invariant: ((((((((((((((((((((((((1 <= unknown-#length-unknown[spanp] && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (s2 <= ULTIMATE.start_main_~nondetString2~0.offset && unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + ULTIMATE.start_main_~nondetString2~0.offset + -1] == 0) && ULTIMATE.start_main_~nondetString2~0.offset <= 0)) && length1 == unknown-#length-unknown[nondetString1]) && !(nondetString1 == nondetString2)) && 1 <= p) && p <= s1) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1]) && \valid[p] == 1) && s1 <= p) && 1 <= length2) && 1 <= unknown-#length-unknown[s2]) && 0 == s2) && c == 0) && nondetString1 + length1 <= 1) && 1 <= length1) && 1 == \valid[nondetString1]) && nondetString1 == 0) && 1 == \valid[spanp]) && nondetString2 == 0) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (0 == unknown-#memory_int-unknown[spanp][unknown-#length-unknown[spanp] + ULTIMATE.start_main_~nondetString2~0.offset + -1] && spanp <= ULTIMATE.start_main_~nondetString2~0.offset) && ULTIMATE.start_main_~nondetString2~0.offset <= 0)) && 1 == \valid[nondetString2]) && \valid[s2] == 1) && unknown-#length-unknown[nondetString2] == length2) && 0 == spanp) || ((((unknown-#memory_int-unknown[spanp][unknown-#length-unknown[spanp] + -1] == 0 && spanp + 1 <= unknown-#length-unknown[spanp]) && ((((((((((((((((((1 <= spanp && length1 == unknown-#length-unknown[nondetString1]) && !(nondetString1 == nondetString2)) && 1 <= p) && p <= s1) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1]) && \valid[p] == 1) && s1 <= p) && 1 <= length2) && 1 <= unknown-#length-unknown[s2]) && 0 == s2) && c == 0) && 1 <= length1) && nondetString1 + length1 <= 1) && 1 == \valid[nondetString1]) && nondetString1 == 0) && nondetString2 == 0) && 1 == \valid[spanp]) && 1 == \valid[nondetString2]) && \valid[s2] == 1) && unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1] == 0) && unknown-#length-unknown[nondetString2] == length2)) || ((((((((((((((((((((((((((1 <= unknown-#length-unknown[spanp] && length1 == unknown-#length-unknown[nondetString1]) && 1 <= p) && p <= s1) && \valid[p] == 1) && s1 <= p) && 1 <= length2) && 1 <= unknown-#length-unknown[s2]) && 0 == s2) && 1 <= length1) && 1 == \valid[nondetString1]) && 1 == \valid[spanp]) && 1 == \valid[nondetString2]) && \valid[s2] == 1) && unknown-#memory_int-unknown[spanp][unknown-#length-unknown[spanp] + -1] == 0) && unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1] == 0) && nondetString2 == 0) && 0 == spanp) || (((unknown-#memory_int-unknown[spanp][unknown-#length-unknown[spanp] + -1] == 0 && spanp + 1 <= unknown-#length-unknown[spanp]) && ((((((((((((((\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (s2 <= ULTIMATE.start_main_~nondetString2~0.offset && unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + ULTIMATE.start_main_~nondetString2~0.offset + -1] == 0) && ULTIMATE.start_main_~nondetString2~0.offset <= 0) && 1 <= spanp) && length1 == unknown-#length-unknown[nondetString1]) && 1 <= p) && p <= s1) && \valid[p] == 1) && s1 <= p) && 1 <= length2) && 1 <= unknown-#length-unknown[s2]) && 0 == s2) && 1 <= length1) && 1 == \valid[nondetString1]) && 1 == \valid[spanp]) && 1 == \valid[nondetString2]) && \valid[s2] == 1) && nondetString2 == 0)) && nondetString1 == 0) && !(nondetString1 == nondetString2)) && p <= unknown-#length-unknown[p]) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start_main_~nondetString2~0.base][unknown-#length-unknown[ULTIMATE.start_main_~nondetString2~0.base] + ULTIMATE.start_main_~nondetString2~0.offset + -1] && !(ULTIMATE.start_main_~nondetString2~0.base == p))) && (c == 0 || p + 1 <= unknown-#length-unknown[p])) && unknown-#memory_int-unknown[nondetString1][unknown-#length-unknown[nondetString1] + -1] == 0) && unknown-#length-unknown[nondetString2] == length2) && 0 == unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + -1]) 122.60/77.75 - InvariantResult [Line: 22]: Loop Invariant 122.60/77.75 [2019-03-28 12:36:26,345 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,345 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,345 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,345 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,345 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,346 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,346 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,346 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,347 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,347 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,347 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,348 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,348 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,348 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,348 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,348 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,349 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,350 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,350 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,350 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,350 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,350 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,351 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,351 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,351 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,352 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,352 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,352 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,352 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,353 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,353 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,353 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,353 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,353 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,354 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,354 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,354 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,355 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,355 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,355 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,355 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,356 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,356 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,356 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,356 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,356 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,357 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,357 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,357 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,357 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,357 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,357 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,358 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,358 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,359 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,359 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,359 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,359 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,360 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,360 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,360 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,361 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,361 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,361 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,362 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,362 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,362 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,362 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,362 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,363 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,363 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 122.60/77.75 [2019-03-28 12:36:26,364 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,364 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,364 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,365 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,365 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,365 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,365 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,366 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,366 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,366 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,367 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,367 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,367 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,367 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,367 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,368 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,368 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,368 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,368 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,369 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,369 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,369 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,369 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,370 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,370 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,370 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,370 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,371 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,371 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,371 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,371 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,371 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,371 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,372 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 122.60/77.75 [2019-03-28 12:36:26,372 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,372 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 [2019-03-28 12:36:26,372 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 122.60/77.75 Derived loop invariant: (((((!(nondetString1 == nondetString2) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start_main_~nondetString2~0.base][unknown-#length-unknown[ULTIMATE.start_main_~nondetString2~0.base] + ULTIMATE.start_main_~nondetString2~0.offset + -1] && !(ULTIMATE.start_main_~nondetString2~0.base == p))) && p + 1 <= unknown-#length-unknown[p] && (unknown-#memory_int-unknown[spanp][unknown-#length-unknown[spanp] + -1] == 0 && nondetString1 == 0 && (((((((((((((((((\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (s2 <= ULTIMATE.start_main_~nondetString2~0.offset && unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + ULTIMATE.start_main_~nondetString2~0.offset + -1] == 0) && ULTIMATE.start_main_~nondetString2~0.offset <= 0) && 1 <= spanp) && length1 == unknown-#length-unknown[nondetString1]) && 1 <= p) && p <= s1) && unknown-#length-unknown[nondetString2] == length2) && \valid[p] == 1) && s1 <= p) && 1 <= length2) && 1 <= unknown-#length-unknown[s2]) && 0 == s2) && 1 <= length1) && 1 == \valid[nondetString1]) && nondetString2 == 0) && 1 == \valid[spanp]) && (spanp + 1 <= unknown-#length-unknown[spanp] || sc == 0)) && 1 == \valid[nondetString2]) && \valid[s2] == 1) && spanp <= unknown-#length-unknown[spanp]) && unknown-#memory_int-unknown[nondetString1][unknown-#length-unknown[nondetString1] + -1] == 0) && 0 == unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + -1]) || ((((((((((((((((((((unknown-#memory_int-unknown[p][p] == 0 && p + 1 <= unknown-#length-unknown[p]) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (s2 <= ULTIMATE.start_main_~nondetString2~0.offset && unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + ULTIMATE.start_main_~nondetString2~0.offset + -1] == 0) && ULTIMATE.start_main_~nondetString2~0.offset <= 0)) && length1 == unknown-#length-unknown[nondetString1]) && !(nondetString1 == nondetString2)) && p <= s1) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1]) && \valid[p] == 1) && s1 <= p) && 1 <= length2) && 1 <= unknown-#length-unknown[s2]) && 0 == s2) && nondetString1 + length1 <= 1) && 1 <= length1) && 1 == \valid[nondetString1]) && nondetString2 == 0) && 1 == \valid[nondetString2]) && \valid[s2] == 1) && 0 == p) && nondetString1 == 0) && unknown-#length-unknown[nondetString2] == length2)) || ((((((((0 == s2 && nondetString1 == 0) && !(nondetString1 == nondetString2)) && nondetString2 == 0) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start_main_~nondetString2~0.base][unknown-#length-unknown[ULTIMATE.start_main_~nondetString2~0.base] + ULTIMATE.start_main_~nondetString2~0.offset + -1] && !(ULTIMATE.start_main_~nondetString2~0.base == p))) && unknown-#memory_int-unknown[nondetString1][unknown-#length-unknown[nondetString1] + -1] == 0) && unknown-#length-unknown[nondetString2] == length2) && 0 == unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + -1]) && 0 == p && ((((((((((p + 1 <= unknown-#length-unknown[p] && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (s2 <= ULTIMATE.start_main_~nondetString2~0.offset && unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + ULTIMATE.start_main_~nondetString2~0.offset + -1] == 0) && ULTIMATE.start_main_~nondetString2~0.offset <= 0)) && length1 == unknown-#length-unknown[nondetString1]) && p <= s1) && \valid[p] == 1) && s1 <= p) && 1 <= length2) && 1 <= unknown-#length-unknown[s2]) && 1 <= length1) && 1 == \valid[nondetString1]) && 1 == \valid[nondetString2]) && \valid[s2] == 1) 122.60/77.75 - StatisticsResult: Ultimate Automizer benchmark data 122.60/77.75 CFG has 1 procedures, 22 locations, 9 error locations. SAFE Result, 61.7s OverallTime, 26 OverallIterations, 4 TraceHistogramMax, 11.8s AutomataDifference, 0.0s DeadEndRemovalTime, 43.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 183 SDtfs, 1818 SDslu, 1461 SDs, 0 SdLazy, 3201 SolverSat, 467 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 491 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 342 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1534 ImplicationChecksByTransitivity, 10.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=20, 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: 0.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 360 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 36 NumberOfFragments, 959 HoareAnnotationTreeSize, 2 FomulaSimplifications, 6568994 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 2 FomulaSimplificationsInter, 1153186 FormulaSimplificationTreeSizeReductionInter, 42.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 499 NumberOfCodeBlocks, 499 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 463 ConstructedInterpolants, 55 QuantifiedInterpolants, 101326 SizeOfPredicates, 124 NumberOfNonLiveVariables, 1315 ConjunctsInSsa, 283 ConjunctsInUnsatCore, 36 InterpolantComputations, 16 PerfectInterpolantSequences, 46/176 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 122.60/77.75 - StatisticsResult: Constructed decomposition of program 122.60/77.75 Your program was decomposed into 2 terminating modules (1 trivial, 0 deterministic, 1 nondeterministic) and one module whose termination is unknown.One nondeterministic module has affine ranking function -1 * p + unknown-#length-unknown[alloca(length1 * sizeof(char))] and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 8 locations. The remainder module has 18 locations. 122.60/77.75 - StatisticsResult: Timing statistics 122.60/77.75 BüchiAutomizer plugin needed 10.4s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 9.7s. Construction of modules took 0.2s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 29 SDtfs, 143 SDslu, 157 SDs, 0 SdLazy, 281 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn1 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital222 mio100 ax100 hnf100 lsp97 ukn82 mio100 lsp45 div100 bol100 ite100 ukn100 eq196 hnf89 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 4ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 6 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 122.60/77.75 - TerminationAnalysisResult: Unable to decide termination 122.60/77.75 Buchi Automizer is unable to decide termination for the following lasso. 122.60/77.75 Stem: "[150] ULTIMATE.startENTRY-->L36: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~ret8=|v_ULTIMATE.start_main_#t~ret8_4|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~ret8, ULTIMATE.start_main_~length2~0]" "[102] L36-->L36-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[]" "[103] L36-2-->L39-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[]" "[121] L39-1-->L44: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc6.base_2| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc6.base_2| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc6.base_2|)) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc6.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc7.base_2| v_ULTIMATE.start_main_~length2~0_7)) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_2|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_2|, #valid=|v_#valid_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc7.offset]" "[95] L44-->L44-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int]" "[151] L44-1-->L22-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= v_ULTIMATE.start_cstrcspn_~s1.offset_4 |v_ULTIMATE.start_cstrcspn_#in~s1.offset_2|) (= v_ULTIMATE.start_cstrcspn_~s1.base_5 v_ULTIMATE.start_cstrcspn_~p~0.base_8) (= |v_ULTIMATE.start_cstrcspn_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= |v_ULTIMATE.start_cstrcspn_#in~s1.base_2| v_ULTIMATE.start_cstrcspn_~s1.base_5) (= |v_ULTIMATE.start_cstrcspn_#in~s2.offset_2| v_ULTIMATE.start_cstrcspn_~s2.offset_4) (= |v_ULTIMATE.start_cstrcspn_#in~s2.base_2| v_ULTIMATE.start_cstrcspn_~s2.base_4) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrcspn_#in~s1.offset_2|) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0))) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_cstrcspn_~s1.offset_4 v_ULTIMATE.start_cstrcspn_~p~0.offset_7) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrcspn_#in~s2.offset_2|) (= |v_ULTIMATE.start_cstrcspn_#in~s2.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_8|, ULTIMATE.start_cstrcspn_#t~post0.base=|v_ULTIMATE.start_cstrcspn_#t~post0.base_7|, ULTIMATE.start_cstrcspn_~s1.offset=v_ULTIMATE.start_cstrcspn_~s1.offset_4, ULTIMATE.start_cstrcspn_~s2.offset=v_ULTIMATE.start_cstrcspn_~s2.offset_4, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrcspn_#t~post0.offset=|v_ULTIMATE.start_cstrcspn_#t~post0.offset_6|, ULTIMATE.start_cstrcspn_#in~s2.base=|v_ULTIMATE.start_cstrcspn_#in~s2.base_2|, ULTIMATE.start_cstrcspn_#in~s1.base=|v_ULTIMATE.start_cstrcspn_#in~s1.base_2|, #length=|v_#length_12|, ULTIMATE.start_cstrcspn_#in~s1.offset=|v_ULTIMATE.start_cstrcspn_#in~s1.offset_2|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_8, ULTIMATE.start_cstrcspn_~spanp~0.offset=v_ULTIMATE.start_cstrcspn_~spanp~0.offset_6, ULTIMATE.start_cstrcspn_~s1.base=v_ULTIMATE.start_cstrcspn_~s1.base_5, ULTIMATE.start_cstrcspn_~s2.base=v_ULTIMATE.start_cstrcspn_~s2.base_4, ULTIMATE.start_cstrcspn_~spanp~0.base=v_ULTIMATE.start_cstrcspn_~spanp~0.base_6, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_7|, ULTIMATE.start_cstrcspn_#t~mem3=|v_ULTIMATE.start_cstrcspn_#t~mem3_6|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrcspn_~p~0.offset=v_ULTIMATE.start_cstrcspn_~p~0.offset_7, ULTIMATE.start_cstrcspn_#t~mem1=|v_ULTIMATE.start_cstrcspn_#t~mem1_5|, ULTIMATE.start_cstrcspn_~p~0.base=v_ULTIMATE.start_cstrcspn_~p~0.base_8, ULTIMATE.start_cstrcspn_#in~s2.offset=|v_ULTIMATE.start_cstrcspn_#in~s2.offset_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrcspn_#res=|v_ULTIMATE.start_cstrcspn_#res_4|, ULTIMATE.start_cstrcspn_~c~0=v_ULTIMATE.start_cstrcspn_~c~0_6} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~post2.base, ULTIMATE.start_cstrcspn_~spanp~0.offset, ULTIMATE.start_cstrcspn_~s1.base, ULTIMATE.start_cstrcspn_~s2.base, ULTIMATE.start_cstrcspn_#t~post0.base, ULTIMATE.start_cstrcspn_~s1.offset, ULTIMATE.start_cstrcspn_~spanp~0.base, ULTIMATE.start_cstrcspn_#t~post2.offset, ULTIMATE.start_cstrcspn_#t~mem3, ULTIMATE.start_cstrcspn_~p~0.offset, ULTIMATE.start_cstrcspn_#t~mem1, ULTIMATE.start_cstrcspn_~p~0.base, ULTIMATE.start_cstrcspn_~s2.offset, ULTIMATE.start_cstrcspn_#in~s2.offset, ULTIMATE.start_cstrcspn_#t~post0.offset, #memory_int, ULTIMATE.start_cstrcspn_#in~s2.base, ULTIMATE.start_cstrcspn_#in~s1.base, ULTIMATE.start_cstrcspn_#in~s1.offset, ULTIMATE.start_cstrcspn_#res, ULTIMATE.start_cstrcspn_~c~0, ULTIMATE.start_cstrcspn_~sc~0]" "[70] L22-2-->L23: Formula: (and (= |v_ULTIMATE.start_cstrcspn_#t~post0.base_2| v_ULTIMATE.start_cstrcspn_~p~0.base_5) (= v_ULTIMATE.start_cstrcspn_~p~0.base_4 |v_ULTIMATE.start_cstrcspn_#t~post0.base_2|) (= |v_ULTIMATE.start_cstrcspn_#t~post0.offset_2| v_ULTIMATE.start_cstrcspn_~p~0.offset_5) (= v_ULTIMATE.start_cstrcspn_~p~0.offset_4 (+ |v_ULTIMATE.start_cstrcspn_#t~post0.offset_2| 1))) InVars {ULTIMATE.start_cstrcspn_~p~0.base=v_ULTIMATE.start_cstrcspn_~p~0.base_5, ULTIMATE.start_cstrcspn_~p~0.offset=v_ULTIMATE.start_cstrcspn_~p~0.offset_5} OutVars{ULTIMATE.start_cstrcspn_#t~post0.offset=|v_ULTIMATE.start_cstrcspn_#t~post0.offset_2|, ULTIMATE.start_cstrcspn_~p~0.base=v_ULTIMATE.start_cstrcspn_~p~0.base_4, ULTIMATE.start_cstrcspn_#t~post0.base=|v_ULTIMATE.start_cstrcspn_#t~post0.base_2|, ULTIMATE.start_cstrcspn_~p~0.offset=v_ULTIMATE.start_cstrcspn_~p~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_~p~0.base, ULTIMATE.start_cstrcspn_#t~post0.offset, ULTIMATE.start_cstrcspn_#t~post0.base, ULTIMATE.start_cstrcspn_~p~0.offset]" "[152] L23-->L25-3: Formula: (and (<= 0 |v_ULTIMATE.start_cstrcspn_#t~post0.offset_8|) (<= (+ |v_ULTIMATE.start_cstrcspn_#t~post0.offset_8| 1) (select |v_#length_13| |v_ULTIMATE.start_cstrcspn_#t~post0.base_9|)) (= 1 (select |v_#valid_20| |v_ULTIMATE.start_cstrcspn_#t~post0.base_9|)) (= v_ULTIMATE.start_cstrcspn_~s2.base_5 v_ULTIMATE.start_cstrcspn_~spanp~0.base_7) (= v_ULTIMATE.start_cstrcspn_~c~0_7 (select (select |v_#memory_int_9| |v_ULTIMATE.start_cstrcspn_#t~post0.base_9|) |v_ULTIMATE.start_cstrcspn_#t~post0.offset_8|)) (= v_ULTIMATE.start_cstrcspn_~spanp~0.offset_7 v_ULTIMATE.start_cstrcspn_~s2.offset_5)) InVars {ULTIMATE.start_cstrcspn_~s2.offset=v_ULTIMATE.start_cstrcspn_~s2.offset_5, #valid=|v_#valid_20|, ULTIMATE.start_cstrcspn_#t~post0.offset=|v_ULTIMATE.start_cstrcspn_#t~post0.offset_8|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrcspn_~s2.base=v_ULTIMATE.start_cstrcspn_~s2.base_5, #length=|v_#length_13|, ULTIMATE.start_cstrcspn_#t~post0.base=|v_ULTIMATE.start_cstrcspn_#t~post0.base_9|} OutVars{ULTIMATE.start_cstrcspn_~s2.offset=v_ULTIMATE.start_cstrcspn_~s2.offset_5, #valid=|v_#valid_20|, ULTIMATE.start_cstrcspn_~spanp~0.offset=v_ULTIMATE.start_cstrcspn_~spanp~0.offset_7, ULTIMATE.start_cstrcspn_#t~post0.offset=|v_ULTIMATE.start_cstrcspn_#t~post0.offset_7|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrcspn_~s2.base=v_ULTIMATE.start_cstrcspn_~s2.base_5, #length=|v_#length_13|, ULTIMATE.start_cstrcspn_#t~post0.base=|v_ULTIMATE.start_cstrcspn_#t~post0.base_8|, ULTIMATE.start_cstrcspn_~spanp~0.base=v_ULTIMATE.start_cstrcspn_~spanp~0.base_7, ULTIMATE.start_cstrcspn_~c~0=v_ULTIMATE.start_cstrcspn_~c~0_7, ULTIMATE.start_cstrcspn_#t~mem1=|v_ULTIMATE.start_cstrcspn_#t~mem1_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_~spanp~0.offset, ULTIMATE.start_cstrcspn_#t~post0.offset, ULTIMATE.start_cstrcspn_#t~post0.base, ULTIMATE.start_cstrcspn_~spanp~0.base, ULTIMATE.start_cstrcspn_~c~0, ULTIMATE.start_cstrcspn_#t~mem1]" "[73] L25-3-->L26: Formula: (and (= v_ULTIMATE.start_cstrcspn_~spanp~0.base_4 |v_ULTIMATE.start_cstrcspn_#t~post2.base_2|) (= v_ULTIMATE.start_cstrcspn_~spanp~0.offset_4 (+ |v_ULTIMATE.start_cstrcspn_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrcspn_#t~post2.offset_2| v_ULTIMATE.start_cstrcspn_~spanp~0.offset_5) (= |v_ULTIMATE.start_cstrcspn_#t~post2.base_2| v_ULTIMATE.start_cstrcspn_~spanp~0.base_5)) InVars {ULTIMATE.start_cstrcspn_~spanp~0.offset=v_ULTIMATE.start_cstrcspn_~spanp~0.offset_5, ULTIMATE.start_cstrcspn_~spanp~0.base=v_ULTIMATE.start_cstrcspn_~spanp~0.base_5} OutVars{ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_2|, ULTIMATE.start_cstrcspn_~spanp~0.offset=v_ULTIMATE.start_cstrcspn_~spanp~0.offset_4, ULTIMATE.start_cstrcspn_~spanp~0.base=v_ULTIMATE.start_cstrcspn_~spanp~0.base_4, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~post2.base, ULTIMATE.start_cstrcspn_~spanp~0.offset, ULTIMATE.start_cstrcspn_~spanp~0.base, ULTIMATE.start_cstrcspn_#t~post2.offset]" "[153] L26-->L26-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrcspn_#t~post2.offset_8|) (<= (+ |v_ULTIMATE.start_cstrcspn_#t~post2.offset_8| 1) (select |v_#length_14| |v_ULTIMATE.start_cstrcspn_#t~post2.base_9|)) (= v_ULTIMATE.start_cstrcspn_~sc~0_9 |v_ULTIMATE.start_cstrcspn_#t~mem3_7|) (= (select |v_#valid_21| |v_ULTIMATE.start_cstrcspn_#t~post2.base_9|) 1) (= |v_ULTIMATE.start_cstrcspn_#t~mem3_7| (select (select |v_#memory_int_10| |v_ULTIMATE.start_cstrcspn_#t~post2.base_9|) |v_ULTIMATE.start_cstrcspn_#t~post2.offset_8|))) InVars {ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_8|} OutVars{ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ULTIMATE.start_cstrcspn_#t~mem3=|v_ULTIMATE.start_cstrcspn_#t~mem3_7|, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_8|, ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_9} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~mem3, ULTIMATE.start_cstrcspn_~sc~0]" "[140] L26-2-->L25-1: Formula: (> v_ULTIMATE.start_cstrcspn_~sc~0_5 v_ULTIMATE.start_cstrcspn_~c~0_5) InVars {ULTIMATE.start_cstrcspn_~c~0=v_ULTIMATE.start_cstrcspn_~c~0_5, ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_5} OutVars{ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_7|, ULTIMATE.start_cstrcspn_~c~0=v_ULTIMATE.start_cstrcspn_~c~0_5, ULTIMATE.start_cstrcspn_#t~mem3=|v_ULTIMATE.start_cstrcspn_#t~mem3_5|, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_6|, ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~post2.base, ULTIMATE.start_cstrcspn_#t~mem3, ULTIMATE.start_cstrcspn_#t~post2.offset]" "[148] L25-1-->L25-3: Formula: (< v_ULTIMATE.start_cstrcspn_~sc~0_7 0) InVars {ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_7} OutVars{ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_7} AuxVars[] AssignedVars[]" "[73] L25-3-->L26: Formula: (and (= v_ULTIMATE.start_cstrcspn_~spanp~0.base_4 |v_ULTIMATE.start_cstrcspn_#t~post2.base_2|) (= v_ULTIMATE.start_cstrcspn_~spanp~0.offset_4 (+ |v_ULTIMATE.start_cstrcspn_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrcspn_#t~post2.offset_2| v_ULTIMATE.start_cstrcspn_~spanp~0.offset_5) (= |v_ULTIMATE.start_cstrcspn_#t~post2.base_2| v_ULTIMATE.start_cstrcspn_~spanp~0.base_5)) InVars {ULTIMATE.start_cstrcspn_~spanp~0.offset=v_ULTIMATE.start_cstrcspn_~spanp~0.offset_5, ULTIMATE.start_cstrcspn_~spanp~0.base=v_ULTIMATE.start_cstrcspn_~spanp~0.base_5} OutVars{ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_2|, ULTIMATE.start_cstrcspn_~spanp~0.offset=v_ULTIMATE.start_cstrcspn_~spanp~0.offset_4, ULTIMATE.start_cstrcspn_~spanp~0.base=v_ULTIMATE.start_cstrcspn_~spanp~0.base_4, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~post2.base, ULTIMATE.start_cstrcspn_~spanp~0.offset, ULTIMATE.start_cstrcspn_~spanp~0.base, ULTIMATE.start_cstrcspn_#t~post2.offset]" 122.60/77.75 Loop: "[153] L26-->L26-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrcspn_#t~post2.offset_8|) (<= (+ |v_ULTIMATE.start_cstrcspn_#t~post2.offset_8| 1) (select |v_#length_14| |v_ULTIMATE.start_cstrcspn_#t~post2.base_9|)) (= v_ULTIMATE.start_cstrcspn_~sc~0_9 |v_ULTIMATE.start_cstrcspn_#t~mem3_7|) (= (select |v_#valid_21| |v_ULTIMATE.start_cstrcspn_#t~post2.base_9|) 1) (= |v_ULTIMATE.start_cstrcspn_#t~mem3_7| (select (select |v_#memory_int_10| |v_ULTIMATE.start_cstrcspn_#t~post2.base_9|) |v_ULTIMATE.start_cstrcspn_#t~post2.offset_8|))) InVars {ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_8|} OutVars{ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ULTIMATE.start_cstrcspn_#t~mem3=|v_ULTIMATE.start_cstrcspn_#t~mem3_7|, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_8|, ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_9} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~mem3, ULTIMATE.start_cstrcspn_~sc~0]" "[140] L26-2-->L25-1: Formula: (> v_ULTIMATE.start_cstrcspn_~sc~0_5 v_ULTIMATE.start_cstrcspn_~c~0_5) InVars {ULTIMATE.start_cstrcspn_~c~0=v_ULTIMATE.start_cstrcspn_~c~0_5, ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_5} OutVars{ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_7|, ULTIMATE.start_cstrcspn_~c~0=v_ULTIMATE.start_cstrcspn_~c~0_5, ULTIMATE.start_cstrcspn_#t~mem3=|v_ULTIMATE.start_cstrcspn_#t~mem3_5|, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_6|, ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~post2.base, ULTIMATE.start_cstrcspn_#t~mem3, ULTIMATE.start_cstrcspn_#t~post2.offset]" "[148] L25-1-->L25-3: Formula: (< v_ULTIMATE.start_cstrcspn_~sc~0_7 0) InVars {ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_7} OutVars{ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_7} AuxVars[] AssignedVars[]" "[73] L25-3-->L26: Formula: (and (= v_ULTIMATE.start_cstrcspn_~spanp~0.base_4 |v_ULTIMATE.start_cstrcspn_#t~post2.base_2|) (= v_ULTIMATE.start_cstrcspn_~spanp~0.offset_4 (+ |v_ULTIMATE.start_cstrcspn_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrcspn_#t~post2.offset_2| v_ULTIMATE.start_cstrcspn_~spanp~0.offset_5) (= |v_ULTIMATE.start_cstrcspn_#t~post2.base_2| v_ULTIMATE.start_cstrcspn_~spanp~0.base_5)) InVars {ULTIMATE.start_cstrcspn_~spanp~0.offset=v_ULTIMATE.start_cstrcspn_~spanp~0.offset_5, ULTIMATE.start_cstrcspn_~spanp~0.base=v_ULTIMATE.start_cstrcspn_~spanp~0.base_5} OutVars{ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_2|, ULTIMATE.start_cstrcspn_~spanp~0.offset=v_ULTIMATE.start_cstrcspn_~spanp~0.offset_4, ULTIMATE.start_cstrcspn_~spanp~0.base=v_ULTIMATE.start_cstrcspn_~spanp~0.base_4, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~post2.base, ULTIMATE.start_cstrcspn_~spanp~0.offset, ULTIMATE.start_cstrcspn_~spanp~0.base, ULTIMATE.start_cstrcspn_#t~post2.offset]" 122.60/77.75 RESULT: Ultimate could not prove your program: unable to determine termination 122.60/77.75 !SESSION 2019-03-28 12:35:09.675 ----------------------------------------------- 122.60/77.75 eclipse.buildId=unknown 122.60/77.75 java.version=1.8.0_181 122.60/77.75 java.vendor=Oracle Corporation 122.60/77.75 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 122.60/77.75 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 122.60/77.75 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 122.60/77.75 122.60/77.75 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:36:26.601 122.60/77.75 !MESSAGE The workspace will exit with unsaved changes in this session. 122.60/77.75 Received shutdown request... 122.60/77.75 Ultimate: 122.60/77.75 GTK+ Version Check 122.60/77.75 EOF