MAYBE Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 10:17:39,569 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 10:17:39,571 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 10:17:39,583 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 10:17:39,583 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 10:17:39,584 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 10:17:39,585 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 10:17:39,587 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 10:17:39,588 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 10:17:39,589 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 10:17:39,590 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 10:17:39,590 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 10:17:39,591 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 10:17:39,592 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 10:17:39,593 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 10:17:39,594 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 10:17:39,594 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 10:17:39,596 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 10:17:39,598 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 10:17:39,599 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 10:17:39,600 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 10:17:39,601 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 10:17:39,603 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 10:17:39,603 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 10:17:39,604 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 10:17:39,604 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 10:17:39,605 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 10:17:39,606 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 10:17:39,606 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 10:17:39,606 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 10:17:39,607 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 10:17:39,608 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 10:17:39,609 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 10:17:39,609 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 10:17:39,609 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 10:17:39,610 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 10:17:39,610 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 10:17:39,611 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 10:17:39,611 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 10:17:39,612 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 10:17:39,626 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 10:17:39,626 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 10:17:39,627 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 10:17:39,628 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 10:17:39,628 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 10:17:39,628 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:17:39,628 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 10:17:39,628 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 10:17:39,629 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 10:17:39,629 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 10:17:39,629 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 10:17:39,629 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 10:17:39,629 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 10:17:39,629 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 10:17:39,630 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:17:39,630 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 10:17:39,630 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 10:17:39,630 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 10:17:39,630 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 10:17:39,631 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 10:17:39,631 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 10:17:39,631 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 10:17:39,631 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 10:17:39,631 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 10:17:39,631 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:17:39,632 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 10:17:39,632 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 10:17:39,632 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 10:17:39,632 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 10:17:39,657 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 10:17:39,671 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 10:17:39,675 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 10:17:39,676 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 10:17:39,676 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 10:17:39,677 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 10:17:39,745 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/7d2bdeddfd4a4ced8640ec37f712862f/FLAG89c9e0714 [2020-06-22 10:17:40,087 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 10:17:40,088 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 10:17:40,088 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 10:17:40,095 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/7d2bdeddfd4a4ced8640ec37f712862f/FLAG89c9e0714 [2020-06-22 10:17:40,490 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/7d2bdeddfd4a4ced8640ec37f712862f [2020-06-22 10:17:40,502 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 10:17:40,503 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 10:17:40,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 10:17:40,505 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 10:17:40,508 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 10:17:40,509 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:17:40" (1/1) ... [2020-06-22 10:17:40,513 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@350a8b2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:17:40, skipping insertion in model container [2020-06-22 10:17:40,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:17:40" (1/1) ... [2020-06-22 10:17:40,521 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 10:17:40,540 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 10:17:40,710 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:17:40,788 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 10:17:40,809 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:17:40,826 INFO L195 MainTranslator]: Completed translation [2020-06-22 10:17:40,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:17:40 WrapperNode [2020-06-22 10:17:40,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 10:17:40,827 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 10:17:40,827 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 10:17:40,827 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 10:17:40,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:17:40" (1/1) ... [2020-06-22 10:17:40,845 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:17:40" (1/1) ... [2020-06-22 10:17:40,868 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 10:17:40,869 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 10:17:40,869 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 10:17:40,869 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 10:17:40,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:17:40" (1/1) ... [2020-06-22 10:17:40,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:17:40" (1/1) ... [2020-06-22 10:17:40,881 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:17:40" (1/1) ... [2020-06-22 10:17:40,881 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:17:40" (1/1) ... [2020-06-22 10:17:40,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:17:40" (1/1) ... [2020-06-22 10:17:40,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:17:40" (1/1) ... [2020-06-22 10:17:40,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:17:40" (1/1) ... [2020-06-22 10:17:40,897 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 10:17:40,897 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 10:17:40,897 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 10:17:40,897 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 10:17:40,898 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:17:40" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:17:40,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 10:17:40,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 10:17:40,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 10:17:40,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 10:17:40,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 10:17:40,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 10:17:41,208 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 10:17:41,209 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2020-06-22 10:17:41,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:17:41 BoogieIcfgContainer [2020-06-22 10:17:41,210 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 10:17:41,211 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 10:17:41,211 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 10:17:41,213 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 10:17:41,213 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:17:41" (1/1) ... [2020-06-22 10:17:41,230 INFO L313 BlockEncoder]: Initial Icfg 30 locations, 36 edges [2020-06-22 10:17:41,231 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 10:17:41,232 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 10:17:41,232 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 10:17:41,233 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:17:41,234 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 10:17:41,235 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 10:17:41,235 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 10:17:41,257 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 10:17:41,288 INFO L200 BlockEncoder]: SBE split 14 edges [2020-06-22 10:17:41,296 INFO L70 emoveInfeasibleEdges]: Removed 3 edges and 0 locations because of local infeasibility [2020-06-22 10:17:41,298 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:17:41,320 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding [2020-06-22 10:17:41,323 INFO L70 RemoveSinkStates]: Removed 7 edges and 3 locations by removing sink states [2020-06-22 10:17:41,324 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:17:41,325 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:17:41,325 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 10:17:41,326 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:17:41,326 INFO L313 BlockEncoder]: Encoded RCFG 22 locations, 39 edges [2020-06-22 10:17:41,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:17:41 BasicIcfg [2020-06-22 10:17:41,327 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 10:17:41,328 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 10:17:41,328 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 10:17:41,331 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 10:17:41,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 10:17:40" (1/4) ... [2020-06-22 10:17:41,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8e2918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:17:41, skipping insertion in model container [2020-06-22 10:17:41,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:17:40" (2/4) ... [2020-06-22 10:17:41,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8e2918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:17:41, skipping insertion in model container [2020-06-22 10:17:41,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:17:41" (3/4) ... [2020-06-22 10:17:41,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8e2918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:17:41, skipping insertion in model container [2020-06-22 10:17:41,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:17:41" (4/4) ... [2020-06-22 10:17:41,335 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:17:41,344 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 10:17:41,352 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2020-06-22 10:17:41,369 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2020-06-22 10:17:41,398 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:17:41,398 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 10:17:41,399 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 10:17:41,399 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:17:41,399 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:17:41,399 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:17:41,399 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 10:17:41,399 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:17:41,399 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 10:17:41,414 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2020-06-22 10:17:41,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:17:41,420 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:17:41,421 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:17:41,423 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:17:41,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:41,429 INFO L82 PathProgramCache]: Analyzing trace with hash 169792299, now seen corresponding path program 1 times [2020-06-22 10:17:41,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:41,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:41,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:41,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:41,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:41,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:17:41,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:17:41,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:17:41,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:17:41,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:17:41,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:17:41,633 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2020-06-22 10:17:41,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:17:41,749 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2020-06-22 10:17:41,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:17:41,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 10:17:41,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:17:41,764 INFO L225 Difference]: With dead ends: 22 [2020-06-22 10:17:41,765 INFO L226 Difference]: Without dead ends: 21 [2020-06-22 10:17:41,768 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 [2020-06-22 10:17:41,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-06-22 10:17:41,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-06-22 10:17:41,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 10:17:41,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 37 transitions. [2020-06-22 10:17:41,806 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 37 transitions. Word has length 5 [2020-06-22 10:17:41,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:17:41,807 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 37 transitions. [2020-06-22 10:17:41,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:17:41,807 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 37 transitions. [2020-06-22 10:17:41,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:17:41,808 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:17:41,808 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:17:41,808 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:17:41,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:41,809 INFO L82 PathProgramCache]: Analyzing trace with hash 169792301, now seen corresponding path program 1 times [2020-06-22 10:17:41,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:41,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:41,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:41,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:41,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:41,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:17:41,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:17:41,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:17:41,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:17:41,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:17:41,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:17:41,863 INFO L87 Difference]: Start difference. First operand 21 states and 37 transitions. Second operand 3 states. [2020-06-22 10:17:41,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:17:41,938 INFO L93 Difference]: Finished difference Result 22 states and 37 transitions. [2020-06-22 10:17:41,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:17:41,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 10:17:41,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:17:41,939 INFO L225 Difference]: With dead ends: 22 [2020-06-22 10:17:41,939 INFO L226 Difference]: Without dead ends: 21 [2020-06-22 10:17:41,940 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 [2020-06-22 10:17:41,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-06-22 10:17:41,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-06-22 10:17:41,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 10:17:41,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 36 transitions. [2020-06-22 10:17:41,945 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 36 transitions. Word has length 5 [2020-06-22 10:17:41,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:17:41,945 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 36 transitions. [2020-06-22 10:17:41,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:17:41,945 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 36 transitions. [2020-06-22 10:17:41,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:17:41,946 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:17:41,946 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:17:41,946 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:17:41,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:41,946 INFO L82 PathProgramCache]: Analyzing trace with hash 169792302, now seen corresponding path program 1 times [2020-06-22 10:17:41,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:41,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:41,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:41,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:41,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:41,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:17:41,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:17:41,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:17:41,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:17:41,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:17:41,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:17:41,982 INFO L87 Difference]: Start difference. First operand 21 states and 36 transitions. Second operand 4 states. [2020-06-22 10:17:42,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:17:42,038 INFO L93 Difference]: Finished difference Result 21 states and 36 transitions. [2020-06-22 10:17:42,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:17:42,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-06-22 10:17:42,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:17:42,039 INFO L225 Difference]: With dead ends: 21 [2020-06-22 10:17:42,039 INFO L226 Difference]: Without dead ends: 20 [2020-06-22 10:17:42,040 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 [2020-06-22 10:17:42,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-06-22 10:17:42,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-06-22 10:17:42,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 10:17:42,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 35 transitions. [2020-06-22 10:17:42,044 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 35 transitions. Word has length 5 [2020-06-22 10:17:42,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:17:42,045 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 35 transitions. [2020-06-22 10:17:42,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:17:42,045 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 35 transitions. [2020-06-22 10:17:42,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 10:17:42,045 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:17:42,046 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:17:42,046 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:17:42,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:42,046 INFO L82 PathProgramCache]: Analyzing trace with hash 968593264, now seen corresponding path program 1 times [2020-06-22 10:17:42,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:42,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:42,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:42,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:42,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:42,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:17:42,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:17:42,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:17:42,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:17:42,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:17:42,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:17:42,092 INFO L87 Difference]: Start difference. First operand 20 states and 35 transitions. Second operand 3 states. [2020-06-22 10:17:42,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:17:42,143 INFO L93 Difference]: Finished difference Result 21 states and 35 transitions. [2020-06-22 10:17:42,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:17:42,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 10:17:42,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:17:42,145 INFO L225 Difference]: With dead ends: 21 [2020-06-22 10:17:42,145 INFO L226 Difference]: Without dead ends: 20 [2020-06-22 10:17:42,145 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 [2020-06-22 10:17:42,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-06-22 10:17:42,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-06-22 10:17:42,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 10:17:42,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2020-06-22 10:17:42,149 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 34 transitions. Word has length 6 [2020-06-22 10:17:42,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:17:42,150 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 34 transitions. [2020-06-22 10:17:42,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:17:42,150 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 34 transitions. [2020-06-22 10:17:42,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 10:17:42,150 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:17:42,151 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:17:42,151 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:17:42,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:42,151 INFO L82 PathProgramCache]: Analyzing trace with hash 968593265, now seen corresponding path program 1 times [2020-06-22 10:17:42,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:42,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:42,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:42,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:42,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:42,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:42,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:17:42,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:17:42,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:17:42,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:17:42,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:17:42,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:17:42,206 INFO L87 Difference]: Start difference. First operand 20 states and 34 transitions. Second operand 4 states. [2020-06-22 10:17:42,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:17:42,252 INFO L93 Difference]: Finished difference Result 20 states and 34 transitions. [2020-06-22 10:17:42,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:17:42,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-06-22 10:17:42,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:17:42,253 INFO L225 Difference]: With dead ends: 20 [2020-06-22 10:17:42,253 INFO L226 Difference]: Without dead ends: 19 [2020-06-22 10:17:42,254 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 [2020-06-22 10:17:42,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-06-22 10:17:42,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-06-22 10:17:42,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 10:17:42,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2020-06-22 10:17:42,258 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 33 transitions. Word has length 6 [2020-06-22 10:17:42,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:17:42,258 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 33 transitions. [2020-06-22 10:17:42,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:17:42,258 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 33 transitions. [2020-06-22 10:17:42,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 10:17:42,258 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:17:42,259 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:17:42,259 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:17:42,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:42,259 INFO L82 PathProgramCache]: Analyzing trace with hash 968593262, now seen corresponding path program 1 times [2020-06-22 10:17:42,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:42,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:42,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:42,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:42,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:42,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:42,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:17:42,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:17:42,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:17:42,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:17:42,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:17:42,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:17:42,286 INFO L87 Difference]: Start difference. First operand 19 states and 33 transitions. Second operand 3 states. [2020-06-22 10:17:42,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:17:42,332 INFO L93 Difference]: Finished difference Result 19 states and 33 transitions. [2020-06-22 10:17:42,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:17:42,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 10:17:42,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:17:42,333 INFO L225 Difference]: With dead ends: 19 [2020-06-22 10:17:42,333 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 10:17:42,333 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 [2020-06-22 10:17:42,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 10:17:42,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-06-22 10:17:42,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 10:17:42,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 31 transitions. [2020-06-22 10:17:42,337 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 31 transitions. Word has length 6 [2020-06-22 10:17:42,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:17:42,337 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 31 transitions. [2020-06-22 10:17:42,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:17:42,337 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 31 transitions. [2020-06-22 10:17:42,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 10:17:42,338 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:17:42,338 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:17:42,338 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:17:42,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:42,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1189752123, now seen corresponding path program 1 times [2020-06-22 10:17:42,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:42,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:42,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:42,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:42,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:42,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:17:42,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:17:42,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 10:17:42,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 10:17:42,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 10:17:42,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:17:42,399 INFO L87 Difference]: Start difference. First operand 18 states and 31 transitions. Second operand 5 states. [2020-06-22 10:17:42,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:17:42,502 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. [2020-06-22 10:17:42,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 10:17:42,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-06-22 10:17:42,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:17:42,504 INFO L225 Difference]: With dead ends: 18 [2020-06-22 10:17:42,504 INFO L226 Difference]: Without dead ends: 17 [2020-06-22 10:17:42,504 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 [2020-06-22 10:17:42,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-06-22 10:17:42,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-06-22 10:17:42,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 10:17:42,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. [2020-06-22 10:17:42,508 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 29 transitions. Word has length 8 [2020-06-22 10:17:42,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:17:42,508 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 29 transitions. [2020-06-22 10:17:42,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 10:17:42,509 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 29 transitions. [2020-06-22 10:17:42,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 10:17:42,509 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:17:42,509 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:17:42,510 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:17:42,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:42,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1189752121, now seen corresponding path program 1 times [2020-06-22 10:17:42,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:42,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:42,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:42,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:42,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:42,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:17:42,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:17:42,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 10:17:42,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 10:17:42,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 10:17:42,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:17:42,562 INFO L87 Difference]: Start difference. First operand 17 states and 29 transitions. Second operand 5 states. [2020-06-22 10:17:42,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:17:42,658 INFO L93 Difference]: Finished difference Result 21 states and 33 transitions. [2020-06-22 10:17:42,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 10:17:42,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-06-22 10:17:42,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:17:42,659 INFO L225 Difference]: With dead ends: 21 [2020-06-22 10:17:42,659 INFO L226 Difference]: Without dead ends: 20 [2020-06-22 10:17:42,660 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 [2020-06-22 10:17:42,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-06-22 10:17:42,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-06-22 10:17:42,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 10:17:42,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 32 transitions. [2020-06-22 10:17:42,665 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 32 transitions. Word has length 8 [2020-06-22 10:17:42,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:17:42,665 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 32 transitions. [2020-06-22 10:17:42,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 10:17:42,665 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 32 transitions. [2020-06-22 10:17:42,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 10:17:42,666 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:17:42,666 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:17:42,666 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:17:42,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:42,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1189752120, now seen corresponding path program 1 times [2020-06-22 10:17:42,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:42,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:42,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:42,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:42,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:42,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:17:42,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:17:42,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 10:17:42,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 10:17:42,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 10:17:42,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-06-22 10:17:42,747 INFO L87 Difference]: Start difference. First operand 19 states and 32 transitions. Second operand 7 states. [2020-06-22 10:17:42,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:17:42,858 INFO L93 Difference]: Finished difference Result 20 states and 32 transitions. [2020-06-22 10:17:42,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 10:17:42,859 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2020-06-22 10:17:42,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:17:42,859 INFO L225 Difference]: With dead ends: 20 [2020-06-22 10:17:42,859 INFO L226 Difference]: Without dead ends: 19 [2020-06-22 10:17:42,860 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 [2020-06-22 10:17:42,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-06-22 10:17:42,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-06-22 10:17:42,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 10:17:42,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. [2020-06-22 10:17:42,863 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 31 transitions. Word has length 8 [2020-06-22 10:17:42,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:17:42,864 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 31 transitions. [2020-06-22 10:17:42,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 10:17:42,864 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2020-06-22 10:17:42,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 10:17:42,865 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:17:42,865 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:17:42,865 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:17:42,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:42,866 INFO L82 PathProgramCache]: Analyzing trace with hash -890467848, now seen corresponding path program 1 times [2020-06-22 10:17:42,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:42,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:42,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:42,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:42,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:42,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:17:42,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:17:42,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 10:17:42,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 10:17:42,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 10:17:42,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:17:42,910 INFO L87 Difference]: Start difference. First operand 19 states and 31 transitions. Second operand 5 states. [2020-06-22 10:17:42,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:17:42,990 INFO L93 Difference]: Finished difference Result 19 states and 31 transitions. [2020-06-22 10:17:42,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 10:17:42,992 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-06-22 10:17:42,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:17:42,993 INFO L225 Difference]: With dead ends: 19 [2020-06-22 10:17:42,993 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 10:17:42,993 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 [2020-06-22 10:17:42,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 10:17:42,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-06-22 10:17:42,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 10:17:42,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 29 transitions. [2020-06-22 10:17:42,997 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 29 transitions. Word has length 10 [2020-06-22 10:17:42,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:17:42,998 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 29 transitions. [2020-06-22 10:17:42,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 10:17:42,998 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. [2020-06-22 10:17:42,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 10:17:42,998 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:17:42,998 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:17:42,999 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:17:42,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:42,999 INFO L82 PathProgramCache]: Analyzing trace with hash -890467846, now seen corresponding path program 1 times [2020-06-22 10:17:42,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:42,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:43,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:43,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:43,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:43,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:17:43,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:17:43,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 10:17:43,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 10:17:43,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 10:17:43,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-06-22 10:17:43,047 INFO L87 Difference]: Start difference. First operand 18 states and 29 transitions. Second operand 6 states. [2020-06-22 10:17:43,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:17:43,141 INFO L93 Difference]: Finished difference Result 23 states and 36 transitions. [2020-06-22 10:17:43,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 10:17:43,142 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-06-22 10:17:43,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:17:43,143 INFO L225 Difference]: With dead ends: 23 [2020-06-22 10:17:43,143 INFO L226 Difference]: Without dead ends: 22 [2020-06-22 10:17:43,143 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 [2020-06-22 10:17:43,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-06-22 10:17:43,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2020-06-22 10:17:43,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 10:17:43,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 32 transitions. [2020-06-22 10:17:43,147 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 32 transitions. Word has length 10 [2020-06-22 10:17:43,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:17:43,147 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 32 transitions. [2020-06-22 10:17:43,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 10:17:43,148 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2020-06-22 10:17:43,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 10:17:43,148 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:17:43,148 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:17:43,149 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:17:43,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:43,149 INFO L82 PathProgramCache]: Analyzing trace with hash -890467845, now seen corresponding path program 1 times [2020-06-22 10:17:43,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:43,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:43,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:43,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:43,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:43,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:17:43,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:17:43,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 10:17:43,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 10:17:43,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 10:17:43,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-06-22 10:17:43,220 INFO L87 Difference]: Start difference. First operand 20 states and 32 transitions. Second operand 7 states. [2020-06-22 10:17:43,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:17:43,350 INFO L93 Difference]: Finished difference Result 22 states and 35 transitions. [2020-06-22 10:17:43,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 10:17:43,351 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2020-06-22 10:17:43,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:17:43,351 INFO L225 Difference]: With dead ends: 22 [2020-06-22 10:17:43,352 INFO L226 Difference]: Without dead ends: 21 [2020-06-22 10:17:43,352 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 [2020-06-22 10:17:43,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-06-22 10:17:43,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2020-06-22 10:17:43,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 10:17:43,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2020-06-22 10:17:43,355 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 31 transitions. Word has length 10 [2020-06-22 10:17:43,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:17:43,356 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 31 transitions. [2020-06-22 10:17:43,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 10:17:43,356 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 31 transitions. [2020-06-22 10:17:43,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 10:17:43,356 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:17:43,357 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:17:43,357 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:17:43,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:43,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1041090507, now seen corresponding path program 1 times [2020-06-22 10:17:43,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:43,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:43,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:43,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:43,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:43,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:43,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:17:43,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:17:43,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:17:43,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:17:43,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:17:43,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:17:43,392 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. Second operand 3 states. [2020-06-22 10:17:43,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:17:43,428 INFO L93 Difference]: Finished difference Result 21 states and 31 transitions. [2020-06-22 10:17:43,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:17:43,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-06-22 10:17:43,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:17:43,429 INFO L225 Difference]: With dead ends: 21 [2020-06-22 10:17:43,429 INFO L226 Difference]: Without dead ends: 20 [2020-06-22 10:17:43,430 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 [2020-06-22 10:17:43,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-06-22 10:17:43,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-06-22 10:17:43,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 10:17:43,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions. [2020-06-22 10:17:43,433 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 30 transitions. Word has length 12 [2020-06-22 10:17:43,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:17:43,434 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 30 transitions. [2020-06-22 10:17:43,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:17:43,434 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 30 transitions. [2020-06-22 10:17:43,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 10:17:43,434 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:17:43,435 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:17:43,435 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:17:43,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:43,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1041090506, now seen corresponding path program 1 times [2020-06-22 10:17:43,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:43,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:43,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:43,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:43,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:43,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:17:43,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:17:43,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:17:43,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:17:43,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:17:43,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:17:43,464 INFO L87 Difference]: Start difference. First operand 20 states and 30 transitions. Second operand 3 states. [2020-06-22 10:17:43,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:17:43,491 INFO L93 Difference]: Finished difference Result 20 states and 30 transitions. [2020-06-22 10:17:43,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:17:43,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-06-22 10:17:43,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:17:43,492 INFO L225 Difference]: With dead ends: 20 [2020-06-22 10:17:43,492 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 10:17:43,492 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 [2020-06-22 10:17:43,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 10:17:43,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-06-22 10:17:43,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 10:17:43,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2020-06-22 10:17:43,495 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 28 transitions. Word has length 12 [2020-06-22 10:17:43,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:17:43,496 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 28 transitions. [2020-06-22 10:17:43,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:17:43,496 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 28 transitions. [2020-06-22 10:17:43,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-06-22 10:17:43,496 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:17:43,497 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:17:43,497 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:17:43,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:43,497 INFO L82 PathProgramCache]: Analyzing trace with hash 240598607, now seen corresponding path program 1 times [2020-06-22 10:17:43,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:43,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:43,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:43,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:43,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:43,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:43,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:17:43,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:17:43,554 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:17:43,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:43,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:17:43,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:17:43,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:17:43,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:17:43,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2020-06-22 10:17:43,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-06-22 10:17:43,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 10:17:43,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-06-22 10:17:43,656 INFO L87 Difference]: Start difference. First operand 18 states and 28 transitions. Second operand 8 states. [2020-06-22 10:17:43,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:17:43,781 INFO L93 Difference]: Finished difference Result 19 states and 28 transitions. [2020-06-22 10:17:43,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 10:17:43,781 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-06-22 10:17:43,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:17:43,782 INFO L225 Difference]: With dead ends: 19 [2020-06-22 10:17:43,782 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 10:17:43,782 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 [2020-06-22 10:17:43,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 10:17:43,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-06-22 10:17:43,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 10:17:43,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 27 transitions. [2020-06-22 10:17:43,786 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 27 transitions. Word has length 14 [2020-06-22 10:17:43,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:17:43,786 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 27 transitions. [2020-06-22 10:17:43,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-06-22 10:17:43,786 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 27 transitions. [2020-06-22 10:17:43,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-06-22 10:17:43,787 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:17:43,787 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:17:43,787 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:17:43,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:43,788 INFO L82 PathProgramCache]: Analyzing trace with hash 240598608, now seen corresponding path program 1 times [2020-06-22 10:17:43,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:43,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:43,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:43,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:43,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:43,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:17:43,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:17:43,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-06-22 10:17:43,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-06-22 10:17:43,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 10:17:43,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-06-22 10:17:43,937 INFO L87 Difference]: Start difference. First operand 18 states and 27 transitions. Second operand 9 states. [2020-06-22 10:17:44,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:17:44,218 INFO L93 Difference]: Finished difference Result 64 states and 94 transitions. [2020-06-22 10:17:44,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-06-22 10:17:44,219 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2020-06-22 10:17:44,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:17:44,220 INFO L225 Difference]: With dead ends: 64 [2020-06-22 10:17:44,220 INFO L226 Difference]: Without dead ends: 54 [2020-06-22 10:17:44,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2020-06-22 10:17:44,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-06-22 10:17:44,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 31. [2020-06-22 10:17:44,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-06-22 10:17:44,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 49 transitions. [2020-06-22 10:17:44,227 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 49 transitions. Word has length 14 [2020-06-22 10:17:44,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:17:44,227 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 49 transitions. [2020-06-22 10:17:44,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-06-22 10:17:44,228 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 49 transitions. [2020-06-22 10:17:44,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-06-22 10:17:44,228 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:17:44,228 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:17:44,229 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:17:44,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:44,229 INFO L82 PathProgramCache]: Analyzing trace with hash 240663091, now seen corresponding path program 1 times [2020-06-22 10:17:44,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:44,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:44,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:44,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:44,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:44,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:17:44,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:17:44,294 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:17:44,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:44,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:17:44,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:17:44,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:17:44,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:17:44,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 8 [2020-06-22 10:17:44,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-06-22 10:17:44,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 10:17:44,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-06-22 10:17:44,387 INFO L87 Difference]: Start difference. First operand 31 states and 49 transitions. Second operand 9 states. [2020-06-22 10:17:44,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:17:44,567 INFO L93 Difference]: Finished difference Result 34 states and 53 transitions. [2020-06-22 10:17:44,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 10:17:44,579 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2020-06-22 10:17:44,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:17:44,580 INFO L225 Difference]: With dead ends: 34 [2020-06-22 10:17:44,580 INFO L226 Difference]: Without dead ends: 33 [2020-06-22 10:17:44,581 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 [2020-06-22 10:17:44,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-06-22 10:17:44,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2020-06-22 10:17:44,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-06-22 10:17:44,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 47 transitions. [2020-06-22 10:17:44,586 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 47 transitions. Word has length 14 [2020-06-22 10:17:44,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:17:44,587 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 47 transitions. [2020-06-22 10:17:44,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-06-22 10:17:44,587 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 47 transitions. [2020-06-22 10:17:44,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-06-22 10:17:44,588 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:17:44,588 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:17:44,588 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:17:44,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:44,588 INFO L82 PathProgramCache]: Analyzing trace with hash 240663092, now seen corresponding path program 1 times [2020-06-22 10:17:44,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:44,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:44,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:44,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:44,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:44,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:17:44,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:17:44,734 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:17:44,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:44,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:44,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 29 conjunts are in the unsatisfiable core [2020-06-22 10:17:44,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:17:44,833 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:44,834 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 [2020-06-22 10:17:44,834 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:17:44,859 INFO L497 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2020-06-22 10:17:44,859 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:17:44,860 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2020-06-22 10:17:44,888 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 [2020-06-22 10:17:44,888 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:17:44,897 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:44,898 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. [2020-06-22 10:17:44,899 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2020-06-22 10:17:45,021 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:45,022 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 [2020-06-22 10:17:45,026 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:17:45,041 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:45,046 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:17:45,046 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:34 [2020-06-22 10:17:45,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:17:45,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:17:45,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2020-06-22 10:17:45,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-06-22 10:17:45,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-06-22 10:17:45,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2020-06-22 10:17:45,199 INFO L87 Difference]: Start difference. First operand 31 states and 47 transitions. Second operand 17 states. [2020-06-22 10:17:45,690 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2020-06-22 10:17:46,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:17:46,097 INFO L93 Difference]: Finished difference Result 46 states and 71 transitions. [2020-06-22 10:17:46,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-06-22 10:17:46,098 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 14 [2020-06-22 10:17:46,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:17:46,099 INFO L225 Difference]: With dead ends: 46 [2020-06-22 10:17:46,099 INFO L226 Difference]: Without dead ends: 45 [2020-06-22 10:17:46,100 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 [2020-06-22 10:17:46,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-06-22 10:17:46,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2020-06-22 10:17:46,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-06-22 10:17:46,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 62 transitions. [2020-06-22 10:17:46,108 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 62 transitions. Word has length 14 [2020-06-22 10:17:46,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:17:46,108 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 62 transitions. [2020-06-22 10:17:46,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-06-22 10:17:46,108 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 62 transitions. [2020-06-22 10:17:46,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-06-22 10:17:46,109 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:17:46,109 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:17:46,109 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:17:46,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:46,110 INFO L82 PathProgramCache]: Analyzing trace with hash 240628399, now seen corresponding path program 1 times [2020-06-22 10:17:46,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:46,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:46,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:46,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:46,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:46,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:17:46,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:17:46,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-06-22 10:17:46,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-06-22 10:17:46,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 10:17:46,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-06-22 10:17:46,229 INFO L87 Difference]: Start difference. First operand 40 states and 62 transitions. Second operand 9 states. [2020-06-22 10:17:46,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:17:46,433 INFO L93 Difference]: Finished difference Result 72 states and 103 transitions. [2020-06-22 10:17:46,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-06-22 10:17:46,434 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2020-06-22 10:17:46,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:17:46,434 INFO L225 Difference]: With dead ends: 72 [2020-06-22 10:17:46,434 INFO L226 Difference]: Without dead ends: 51 [2020-06-22 10:17:46,435 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 [2020-06-22 10:17:46,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-06-22 10:17:46,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2020-06-22 10:17:46,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-06-22 10:17:46,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2020-06-22 10:17:46,443 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 14 [2020-06-22 10:17:46,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:17:46,443 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2020-06-22 10:17:46,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-06-22 10:17:46,443 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2020-06-22 10:17:46,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-06-22 10:17:46,444 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:17:46,444 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:17:46,444 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:17:46,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:46,445 INFO L82 PathProgramCache]: Analyzing trace with hash -452285215, now seen corresponding path program 1 times [2020-06-22 10:17:46,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:46,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:46,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:46,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:46,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:46,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:17:46,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:17:46,612 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:17:46,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:46,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 32 conjunts are in the unsatisfiable core [2020-06-22 10:17:46,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:17:46,698 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 [2020-06-22 10:17:46,698 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:17:46,710 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:46,711 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. [2020-06-22 10:17:46,711 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:27 [2020-06-22 10:17:46,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 10:17:46,757 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 [2020-06-22 10:17:46,758 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:17:46,776 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:46,777 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. [2020-06-22 10:17:46,778 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:44, output treesize:40 [2020-06-22 10:17:46,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 10:17:46,872 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:46,872 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 [2020-06-22 10:17:46,873 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:17:46,889 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:46,893 INFO L427 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:17:46,893 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:52, output treesize:27 [2020-06-22 10:17:47,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:17:47,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:17:47,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2020-06-22 10:17:47,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-06-22 10:17:47,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-06-22 10:17:47,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2020-06-22 10:17:47,057 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 19 states. [2020-06-22 10:17:48,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:17:48,406 INFO L93 Difference]: Finished difference Result 149 states and 205 transitions. [2020-06-22 10:17:48,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-06-22 10:17:48,407 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 14 [2020-06-22 10:17:48,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:17:48,408 INFO L225 Difference]: With dead ends: 149 [2020-06-22 10:17:48,408 INFO L226 Difference]: Without dead ends: 148 [2020-06-22 10:17:48,409 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 [2020-06-22 10:17:48,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-06-22 10:17:48,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 60. [2020-06-22 10:17:48,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-06-22 10:17:48,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 93 transitions. [2020-06-22 10:17:48,423 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 93 transitions. Word has length 14 [2020-06-22 10:17:48,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:17:48,423 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 93 transitions. [2020-06-22 10:17:48,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-06-22 10:17:48,423 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 93 transitions. [2020-06-22 10:17:48,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-06-22 10:17:48,424 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:17:48,424 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:17:48,424 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:17:48,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:48,425 INFO L82 PathProgramCache]: Analyzing trace with hash -452255424, now seen corresponding path program 1 times [2020-06-22 10:17:48,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:48,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:48,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:48,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:48,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:48,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:17:48,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:17:48,595 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:17:48,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:48,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 32 conjunts are in the unsatisfiable core [2020-06-22 10:17:48,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:17:48,649 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 [2020-06-22 10:17:48,649 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:17:48,658 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:48,659 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. [2020-06-22 10:17:48,659 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:27 [2020-06-22 10:17:48,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 10:17:48,690 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 [2020-06-22 10:17:48,691 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:17:48,703 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:48,704 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. [2020-06-22 10:17:48,704 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:44, output treesize:40 [2020-06-22 10:17:48,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 10:17:48,790 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:48,790 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 [2020-06-22 10:17:48,792 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:17:48,806 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:48,809 INFO L427 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:17:48,809 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:52, output treesize:27 [2020-06-22 10:17:48,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:17:48,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:17:48,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2020-06-22 10:17:48,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-06-22 10:17:48,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-06-22 10:17:48,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2020-06-22 10:17:48,948 INFO L87 Difference]: Start difference. First operand 60 states and 93 transitions. Second operand 19 states. [2020-06-22 10:17:50,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:17:50,377 INFO L93 Difference]: Finished difference Result 183 states and 265 transitions. [2020-06-22 10:17:50,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-06-22 10:17:50,378 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 14 [2020-06-22 10:17:50,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:17:50,379 INFO L225 Difference]: With dead ends: 183 [2020-06-22 10:17:50,379 INFO L226 Difference]: Without dead ends: 182 [2020-06-22 10:17:50,380 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 [2020-06-22 10:17:50,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-06-22 10:17:50,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 52. [2020-06-22 10:17:50,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-06-22 10:17:50,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 77 transitions. [2020-06-22 10:17:50,392 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 77 transitions. Word has length 14 [2020-06-22 10:17:50,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:17:50,393 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 77 transitions. [2020-06-22 10:17:50,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-06-22 10:17:50,393 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 77 transitions. [2020-06-22 10:17:50,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-06-22 10:17:50,394 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:17:50,394 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:17:50,394 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:17:50,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:50,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1468999149, now seen corresponding path program 2 times [2020-06-22 10:17:50,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:50,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:50,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:50,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:50,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:50,607 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:17:50,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:17:50,607 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:17:50,619 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 10:17:50,645 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 10:17:50,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 10:17:50,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 31 conjunts are in the unsatisfiable core [2020-06-22 10:17:50,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:17:50,664 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:50,665 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 [2020-06-22 10:17:50,665 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:17:50,682 INFO L497 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-06-22 10:17:50,682 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:17:50,683 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2020-06-22 10:17:50,704 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 [2020-06-22 10:17:50,704 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:17:50,706 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:50,707 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:17:50,707 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-06-22 10:17:50,780 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:50,781 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 [2020-06-22 10:17:50,782 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:17:50,792 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:50,793 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:17:50,794 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2020-06-22 10:17:50,828 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 10:17:50,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:17:50,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2020-06-22 10:17:50,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-06-22 10:17:50,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-06-22 10:17:50,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-06-22 10:17:50,857 INFO L87 Difference]: Start difference. First operand 52 states and 77 transitions. Second operand 16 states. [2020-06-22 10:17:51,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:17:51,720 INFO L93 Difference]: Finished difference Result 60 states and 88 transitions. [2020-06-22 10:17:51,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-06-22 10:17:51,722 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2020-06-22 10:17:51,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:17:51,723 INFO L225 Difference]: With dead ends: 60 [2020-06-22 10:17:51,723 INFO L226 Difference]: Without dead ends: 40 [2020-06-22 10:17:51,723 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 [2020-06-22 10:17:51,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-06-22 10:17:51,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 21. [2020-06-22 10:17:51,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 10:17:51,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2020-06-22 10:17:51,729 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 18 [2020-06-22 10:17:51,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:17:51,729 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2020-06-22 10:17:51,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-06-22 10:17:51,729 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2020-06-22 10:17:51,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-06-22 10:17:51,730 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:17:51,730 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:17:51,730 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:17:51,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:51,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1405328983, now seen corresponding path program 2 times [2020-06-22 10:17:51,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:51,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:51,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:51,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:17:51,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:51,964 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:17:51,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:17:51,964 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:17:51,975 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 10:17:52,005 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 10:17:52,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 10:17:52,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 35 conjunts are in the unsatisfiable core [2020-06-22 10:17:52,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:17:52,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 10:17:52,016 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 [2020-06-22 10:17:52,016 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:17:52,025 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:52,025 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:17:52,025 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:20 [2020-06-22 10:17:52,055 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 [2020-06-22 10:17:52,056 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:17:52,066 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:52,067 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. [2020-06-22 10:17:52,067 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2020-06-22 10:17:52,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 10:17:52,106 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 [2020-06-22 10:17:52,107 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:17:52,118 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:52,119 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. [2020-06-22 10:17:52,119 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:37 [2020-06-22 10:17:52,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 10:17:52,231 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:52,232 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 [2020-06-22 10:17:52,233 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:17:52,246 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:52,248 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:17:52,249 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:27 [2020-06-22 10:17:52,401 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 10:17:52,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:17:52,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2020-06-22 10:17:52,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-06-22 10:17:52,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-06-22 10:17:52,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2020-06-22 10:17:52,429 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand 20 states. [2020-06-22 10:17:53,148 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2020-06-22 10:17:53,352 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2020-06-22 10:17:53,981 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2020-06-22 10:17:54,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:17:54,770 INFO L93 Difference]: Finished difference Result 75 states and 110 transitions. [2020-06-22 10:17:54,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-06-22 10:17:54,783 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2020-06-22 10:17:54,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:17:54,784 INFO L225 Difference]: With dead ends: 75 [2020-06-22 10:17:54,784 INFO L226 Difference]: Without dead ends: 74 [2020-06-22 10:17:54,785 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 [2020-06-22 10:17:54,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-06-22 10:17:54,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 49. [2020-06-22 10:17:54,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-06-22 10:17:54,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 76 transitions. [2020-06-22 10:17:54,797 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 76 transitions. Word has length 20 [2020-06-22 10:17:54,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:17:54,797 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 76 transitions. [2020-06-22 10:17:54,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-06-22 10:17:54,798 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 76 transitions. [2020-06-22 10:17:54,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-06-22 10:17:54,798 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:17:54,798 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:17:54,799 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:17:54,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:54,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1405299192, now seen corresponding path program 1 times [2020-06-22 10:17:54,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:54,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:54,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:54,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:17:54,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:55,057 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:17:55,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:17:55,057 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:17:55,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:55,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 36 conjunts are in the unsatisfiable core [2020-06-22 10:17:55,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:17:55,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 10:17:55,114 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 [2020-06-22 10:17:55,114 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:17:55,125 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:55,125 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:17:55,125 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:20 [2020-06-22 10:17:55,160 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 [2020-06-22 10:17:55,161 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:17:55,178 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:55,179 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:17:55,179 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2020-06-22 10:17:55,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 10:17:55,210 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 [2020-06-22 10:17:55,210 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:17:55,218 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:55,219 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. [2020-06-22 10:17:55,219 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 [2020-06-22 10:17:55,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 10:17:55,314 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:55,315 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 [2020-06-22 10:17:55,316 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:17:55,327 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:55,329 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:17:55,329 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:27 [2020-06-22 10:17:55,472 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 10:17:55,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:17:55,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2020-06-22 10:17:55,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-06-22 10:17:55,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-06-22 10:17:55,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2020-06-22 10:17:55,500 INFO L87 Difference]: Start difference. First operand 49 states and 76 transitions. Second operand 20 states. [2020-06-22 10:17:57,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:17:57,391 INFO L93 Difference]: Finished difference Result 103 states and 158 transitions. [2020-06-22 10:17:57,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-06-22 10:17:57,392 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2020-06-22 10:17:57,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:17:57,392 INFO L225 Difference]: With dead ends: 103 [2020-06-22 10:17:57,393 INFO L226 Difference]: Without dead ends: 54 [2020-06-22 10:17:57,394 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 [2020-06-22 10:17:57,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-06-22 10:17:57,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 27. [2020-06-22 10:17:57,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 10:17:57,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2020-06-22 10:17:57,400 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 39 transitions. Word has length 20 [2020-06-22 10:17:57,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:17:57,400 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 39 transitions. [2020-06-22 10:17:57,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-06-22 10:17:57,400 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2020-06-22 10:17:57,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-06-22 10:17:57,401 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:17:57,401 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:17:57,402 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:17:57,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:57,402 INFO L82 PathProgramCache]: Analyzing trace with hash 174520754, now seen corresponding path program 1 times [2020-06-22 10:17:57,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:57,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:57,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:57,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:57,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:57,587 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-06-22 10:17:57,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:17:57,587 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:17:57,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:57,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 40 conjunts are in the unsatisfiable core [2020-06-22 10:17:57,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:17:57,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 10:17:57,646 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 [2020-06-22 10:17:57,646 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:17:57,653 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:57,659 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 [2020-06-22 10:17:57,659 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:17:57,666 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:57,666 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:17:57,667 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2020-06-22 10:17:57,691 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 [2020-06-22 10:17:57,691 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:17:57,696 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:57,697 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:17:57,697 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2020-06-22 10:17:57,721 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 [2020-06-22 10:17:57,722 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:17:57,728 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:57,728 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. [2020-06-22 10:17:57,729 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2020-06-22 10:17:57,823 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:57,824 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 [2020-06-22 10:17:57,824 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:17:57,834 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:57,835 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:17:57,835 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:23 [2020-06-22 10:17:57,898 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-06-22 10:17:57,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:17:57,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2020-06-22 10:17:57,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-06-22 10:17:57,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-06-22 10:17:57,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2020-06-22 10:17:57,926 INFO L87 Difference]: Start difference. First operand 27 states and 39 transitions. Second operand 17 states. [2020-06-22 10:17:58,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:17:58,477 INFO L93 Difference]: Finished difference Result 55 states and 82 transitions. [2020-06-22 10:17:58,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-06-22 10:17:58,477 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2020-06-22 10:17:58,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:17:58,478 INFO L225 Difference]: With dead ends: 55 [2020-06-22 10:17:58,478 INFO L226 Difference]: Without dead ends: 54 [2020-06-22 10:17:58,479 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 [2020-06-22 10:17:58,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-06-22 10:17:58,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 28. [2020-06-22 10:17:58,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 10:17:58,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2020-06-22 10:17:58,486 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 42 transitions. Word has length 26 [2020-06-22 10:17:58,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:17:58,486 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 42 transitions. [2020-06-22 10:17:58,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-06-22 10:17:58,486 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 42 transitions. [2020-06-22 10:17:58,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-06-22 10:17:58,487 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:17:58,487 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:17:58,487 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:17:58,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:58,488 INFO L82 PathProgramCache]: Analyzing trace with hash 174550545, now seen corresponding path program 1 times [2020-06-22 10:17:58,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:58,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:58,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:58,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:58,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:58,655 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-06-22 10:17:58,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:17:58,655 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:17:58,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:58,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 40 conjunts are in the unsatisfiable core [2020-06-22 10:17:58,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:17:58,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 10:17:58,721 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 [2020-06-22 10:17:58,721 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:17:58,730 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:58,735 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 [2020-06-22 10:17:58,736 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:17:58,742 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:58,743 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:17:58,743 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2020-06-22 10:17:58,767 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 [2020-06-22 10:17:58,767 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:17:58,773 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:58,774 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:17:58,774 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2020-06-22 10:17:58,800 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 [2020-06-22 10:17:58,800 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:17:58,806 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:58,807 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. [2020-06-22 10:17:58,807 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2020-06-22 10:17:58,902 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:58,903 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 [2020-06-22 10:17:58,904 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:17:58,913 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:58,915 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:17:58,915 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:23 [2020-06-22 10:17:58,973 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-06-22 10:17:59,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:17:59,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2020-06-22 10:17:59,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-06-22 10:17:59,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-06-22 10:17:59,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2020-06-22 10:17:59,001 INFO L87 Difference]: Start difference. First operand 28 states and 42 transitions. Second operand 17 states. [2020-06-22 10:17:59,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:17:59,527 INFO L93 Difference]: Finished difference Result 53 states and 82 transitions. [2020-06-22 10:17:59,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-06-22 10:17:59,528 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2020-06-22 10:17:59,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:17:59,528 INFO L225 Difference]: With dead ends: 53 [2020-06-22 10:17:59,528 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 10:17:59,529 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 [2020-06-22 10:17:59,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 10:17:59,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 10:17:59,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 10:17:59,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 10:17:59,530 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2020-06-22 10:17:59,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:17:59,530 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:17:59,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-06-22 10:17:59,530 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:17:59,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 10:17:59,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 10:17:59,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 10:17:59,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 10:17:59,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 10:17:59,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 10:18:00,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 10:18:00,654 WARN L188 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 358 DAG size of output: 321 [2020-06-22 10:18:00,912 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 248 DAG size of output: 233 [2020-06-22 10:18:39,639 WARN L188 SmtUtils]: Spent 38.72 s on a formula simplification. DAG size of input: 317 DAG size of output: 116 [2020-06-22 10:18:41,648 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 231 DAG size of output: 107 [2020-06-22 10:18:41,651 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. [2020-06-22 10:18:41,651 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-06-22 10:18:41,652 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. [2020-06-22 10:18:41,652 INFO L448 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2020-06-22 10:18:41,652 INFO L448 ceAbstractionStarter]: For program point L25-1(lines 25 28) no Hoare annotation was computed. [2020-06-22 10:18:41,652 INFO L448 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2020-06-22 10:18:41,653 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))))))))) [2020-06-22 10:18:41,653 INFO L448 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2020-06-22 10:18:41,653 INFO L448 ceAbstractionStarter]: For program point L44-1(line 44) no Hoare annotation was computed. [2020-06-22 10:18:41,653 INFO L448 ceAbstractionStarter]: For program point L36(lines 36 38) no Hoare annotation was computed. [2020-06-22 10:18:41,653 INFO L448 ceAbstractionStarter]: For program point L36-2(lines 33 47) no Hoare annotation was computed. [2020-06-22 10:18:41,653 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 10:18:41,653 INFO L448 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2020-06-22 10:18:41,653 INFO L448 ceAbstractionStarter]: For program point L26-2(lines 26 27) no Hoare annotation was computed. [2020-06-22 10:18:41,654 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)))))) [2020-06-22 10:18:41,654 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC(line 27) no Hoare annotation was computed. [2020-06-22 10:18:41,654 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 44) no Hoare annotation was computed. [2020-06-22 10:18:41,654 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 39 41) no Hoare annotation was computed. [2020-06-22 10:18:41,654 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 45) no Hoare annotation was computed. [2020-06-22 10:18:41,654 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 44) no Hoare annotation was computed. [2020-06-22 10:18:41,654 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-06-22 10:18:41,655 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 45) no Hoare annotation was computed. [2020-06-22 10:18:41,655 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 10:18:41,665 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,666 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,666 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,667 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,668 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,668 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,669 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,670 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,670 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,671 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:18:41,671 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:18:41,671 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,671 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:18:41,676 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,677 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,677 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,677 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,679 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,679 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,679 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,679 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,680 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,680 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,680 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,680 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,681 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,681 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,681 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,681 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,682 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,682 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,682 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,683 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,683 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,683 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,683 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,684 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,684 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,684 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,684 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,684 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,685 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,685 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,685 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,686 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,686 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,686 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,686 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,687 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,687 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,687 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,687 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,687 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,698 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,698 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,698 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,699 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,699 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,700 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,701 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,701 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,701 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,702 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:18:41,702 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:18:41,702 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,702 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:18:41,705 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,705 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,706 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,706 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,706 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,707 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,707 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,707 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,707 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,708 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,708 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,708 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,708 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,708 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,709 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,709 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,709 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,709 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,710 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,710 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,710 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,710 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,710 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,711 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,711 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,711 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,711 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,712 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,712 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,712 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,712 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,713 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,713 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,713 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,713 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,714 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,714 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,714 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,714 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,714 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,715 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,715 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,715 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,718 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:18:41,718 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:18:41,718 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,718 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:18:41,719 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,719 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,719 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,720 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,720 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,721 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,721 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:18:41,721 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:18:41,722 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,722 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:18:41,722 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,723 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,723 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,725 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,725 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,725 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,725 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,726 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,726 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,726 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,726 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,727 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,727 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,727 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,727 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,728 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,728 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,728 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,728 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,728 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,729 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,729 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,729 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,729 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,730 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,730 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,730 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,731 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,731 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,731 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,731 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,731 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,731 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,732 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,732 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,732 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,732 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,732 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,733 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,733 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,734 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:18:41,734 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:18:41,735 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,735 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:18:41,735 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,735 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,736 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,736 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,736 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,737 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,737 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:18:41,737 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:18:41,738 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,738 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:18:41,738 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,738 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,738 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:41,740 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,740 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,740 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,740 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,741 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,741 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,741 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,742 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,742 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,742 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,742 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,743 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,743 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,743 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,743 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,743 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,743 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,744 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,744 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,744 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,745 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,745 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,745 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,745 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,746 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,746 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,746 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,746 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,746 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,746 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:41,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,748 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,748 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:41,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:18:41 BasicIcfg [2020-06-22 10:18:41,751 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 10:18:41,751 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 10:18:41,751 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 10:18:41,755 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 10:18:41,756 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:18:41,756 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 10:17:40" (1/5) ... [2020-06-22 10:18:41,756 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@567d28cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:18:41, skipping insertion in model container [2020-06-22 10:18:41,756 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:18:41,756 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:17:40" (2/5) ... [2020-06-22 10:18:41,757 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@567d28cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:18:41, skipping insertion in model container [2020-06-22 10:18:41,757 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:18:41,757 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:17:41" (3/5) ... [2020-06-22 10:18:41,757 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@567d28cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:18:41, skipping insertion in model container [2020-06-22 10:18:41,757 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:18:41,757 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:17:41" (4/5) ... [2020-06-22 10:18:41,758 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@567d28cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:18:41, skipping insertion in model container [2020-06-22 10:18:41,758 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:18:41,758 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:18:41" (5/5) ... [2020-06-22 10:18:41,759 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:18:41,781 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:18:41,781 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 10:18:41,781 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 10:18:41,781 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:18:41,781 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:18:41,781 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:18:41,781 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 10:18:41,781 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:18:41,781 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 10:18:41,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2020-06-22 10:18:41,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 10:18:41,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:18:41,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:18:41,794 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:18:41,794 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:18:41,794 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 10:18:41,794 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2020-06-22 10:18:41,795 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 10:18:41,795 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:18:41,795 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:18:41,796 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:18:41,796 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:18:41,801 INFO L794 eck$LassoCheckResult]: Stem: 13#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] 6#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] 16#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] 14#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] 12#L22-2true [2020-06-22 10:18:41,801 INFO L796 eck$LassoCheckResult]: Loop: 12#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] 3#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[] 12#L22-2true [2020-06-22 10:18:41,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:18:41,802 INFO L82 PathProgramCache]: Analyzing trace with hash 983581043, now seen corresponding path program 1 times [2020-06-22 10:18:41,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:18:41,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:18:41,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:41,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:18:41,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:41,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:18:41,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1260721655, now seen corresponding path program 1 times [2020-06-22 10:18:41,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:18:41,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:18:41,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:41,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:18:41,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:41,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:41,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:18:41,839 INFO L82 PathProgramCache]: Analyzing trace with hash 2064436731, now seen corresponding path program 1 times [2020-06-22 10:18:41,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:18:41,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:18:41,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:41,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:18:41,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:42,199 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2020-06-22 10:18:42,305 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-06-22 10:18:42,318 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:18:42,319 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:18:42,319 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:18:42,319 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:18:42,319 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:18:42,319 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:18:42,319 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:18:42,319 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:18:42,320 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-22 10:18:42,320 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:18:42,320 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:18:42,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:42,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:42,622 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2020-06-22 10:18:42,756 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2020-06-22 10:18:42,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:42,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:42,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:42,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:42,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:42,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:42,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:42,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:42,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:42,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:42,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:42,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:43,210 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:18:43,216 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:18:43,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:43,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:43,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:43,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:43,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:43,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:43,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:18:43,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:43,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:43,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:43,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:43,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:43,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:43,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:43,228 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:43,228 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:43,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:43,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:43,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:43,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:43,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:43,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:43,234 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:43,234 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:43,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:43,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:43,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:43,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:43,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:43,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:43,245 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:43,245 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:43,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:43,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:43,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:43,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:43,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:43,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:43,256 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:43,256 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:43,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:43,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:43,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:43,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:43,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:43,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:43,261 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:43,261 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:43,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:43,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:43,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:43,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:43,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:43,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:43,274 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:43,274 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:43,311 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:18:43,335 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 10:18:43,335 INFO L444 ModelExtractionUtils]: 48 out of 52 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:18:43,337 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:18:43,339 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:18:43,339 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:18:43,340 INFO L520 LassoAnalysis]: Termination argument consisting of: 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 Supporting invariants [] [2020-06-22 10:18:43,388 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2020-06-22 10:18:43,392 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:43,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:18:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:18:43,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:18:43,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:18:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:18:43,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 10:18:43,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:18:43,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:18:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:18:43,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 10:18:43,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:18:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:18:43,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 10:18:43,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:18:43,620 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 8 predicates after loop cannibalization [2020-06-22 10:18:43,625 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 [2020-06-22 10:18:43,626 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 22 states. Second operand 5 states. [2020-06-22 10:18:43,809 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. [2020-06-22 10:18:43,810 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 [2020-06-22 10:18:43,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 10:18:43,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2020-06-22 10:18:43,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62 transitions. Stem has 6 letters. Loop has 6 letters. [2020-06-22 10:18:43,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:18:43,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62 transitions. Stem has 12 letters. Loop has 6 letters. [2020-06-22 10:18:43,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:18:43,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62 transitions. Stem has 6 letters. Loop has 12 letters. [2020-06-22 10:18:43,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:18:43,835 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 71 transitions. [2020-06-22 10:18:43,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 10:18:43,838 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 19 states and 30 transitions. [2020-06-22 10:18:43,839 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 10:18:43,839 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-06-22 10:18:43,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 30 transitions. [2020-06-22 10:18:43,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:18:43,840 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 30 transitions. [2020-06-22 10:18:43,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 30 transitions. [2020-06-22 10:18:43,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2020-06-22 10:18:43,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 10:18:43,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 29 transitions. [2020-06-22 10:18:43,843 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 29 transitions. [2020-06-22 10:18:43,843 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 29 transitions. [2020-06-22 10:18:43,843 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 10:18:43,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 29 transitions. [2020-06-22 10:18:43,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 10:18:43,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:18:43,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:18:43,844 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:18:43,844 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 10:18:43,845 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 [2020-06-22 10:18:43,845 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 [2020-06-22 10:18:43,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:18:43,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1596030756, now seen corresponding path program 1 times [2020-06-22 10:18:43,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:18:43,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:18:43,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:43,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:18:43,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:43,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:18:43,864 INFO L82 PathProgramCache]: Analyzing trace with hash 5620745, now seen corresponding path program 1 times [2020-06-22 10:18:43,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:18:43,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:18:43,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:43,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:18:43,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:43,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:18:43,871 INFO L82 PathProgramCache]: Analyzing trace with hash -426968660, now seen corresponding path program 1 times [2020-06-22 10:18:43,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:18:43,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:18:43,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:43,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:18:43,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:18:43,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:18:43,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:18:43,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-06-22 10:18:44,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 10:18:44,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-06-22 10:18:44,015 INFO L87 Difference]: Start difference. First operand 18 states and 29 transitions. cyclomatic complexity: 13 Second operand 8 states. [2020-06-22 10:18:44,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:18:44,196 INFO L93 Difference]: Finished difference Result 39 states and 57 transitions. [2020-06-22 10:18:44,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-06-22 10:18:44,199 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 57 transitions. [2020-06-22 10:18:44,200 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 10:18:44,201 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 22 states and 33 transitions. [2020-06-22 10:18:44,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-06-22 10:18:44,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-06-22 10:18:44,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 33 transitions. [2020-06-22 10:18:44,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:18:44,201 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 33 transitions. [2020-06-22 10:18:44,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 33 transitions. [2020-06-22 10:18:44,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2020-06-22 10:18:44,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 10:18:44,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2020-06-22 10:18:44,203 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2020-06-22 10:18:44,203 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2020-06-22 10:18:44,203 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 10:18:44,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 28 transitions. [2020-06-22 10:18:44,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 10:18:44,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:18:44,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:18:44,204 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:18:44,204 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 10:18:44,205 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 [2020-06-22 10:18:44,205 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 [2020-06-22 10:18:44,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:18:44,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1421282620, now seen corresponding path program 1 times [2020-06-22 10:18:44,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:18:44,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:18:44,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:44,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:18:44,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:44,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:44,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:18:44,220 INFO L82 PathProgramCache]: Analyzing trace with hash 5620745, now seen corresponding path program 2 times [2020-06-22 10:18:44,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:18:44,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:18:44,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:44,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:18:44,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:44,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:44,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:18:44,226 INFO L82 PathProgramCache]: Analyzing trace with hash -604128316, now seen corresponding path program 1 times [2020-06-22 10:18:44,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:18:44,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:18:44,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:44,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:18:44,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:44,682 WARN L188 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 106 [2020-06-22 10:18:44,813 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-06-22 10:18:44,815 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:18:44,815 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:18:44,815 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:18:44,815 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:18:44,816 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:18:44,816 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:18:44,816 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:18:44,816 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:18:44,816 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso [2020-06-22 10:18:44,816 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:18:44,816 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:18:44,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:44,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:44,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:45,114 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2020-06-22 10:18:45,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:45,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:45,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:45,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:45,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:45,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:45,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:45,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:45,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:45,482 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:18:45,482 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:18:45,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:45,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:45,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:18:45,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:45,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:45,486 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:45,487 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:45,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:45,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:45,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:45,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:45,509 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:45,509 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:45,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:45,512 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:45,513 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:45,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:45,519 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:45,519 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:45,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:45,521 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:45,521 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:45,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:45,525 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:45,525 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:45,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:45,528 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:45,528 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:45,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:45,531 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:45,531 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:45,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:45,536 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:45,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:45,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:45,544 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:45,544 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:45,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:45,551 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:45,551 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:45,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:45,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:45,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:18:45,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:45,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:45,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:45,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:18:45,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:45,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:45,558 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:45,558 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:45,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:45,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:45,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:18:45,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:45,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:45,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:45,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:18:45,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:45,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:45,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:45,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:18:45,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:45,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:45,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:45,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:18:45,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:45,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:45,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:45,567 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:18:45,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:45,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:45,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:45,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:18:45,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:45,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,570 INFO L497 LassoAnalysis]: Using template '2-nested'. [2020-06-22 10:18:45,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:45,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,571 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:45,571 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:45,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:45,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,573 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:45,574 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:45,574 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:45,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,577 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:45,579 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:45,580 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:45,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,605 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:45,606 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:45,606 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:45,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,608 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:45,610 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:45,610 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:45,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,617 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:45,618 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:45,618 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:45,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,620 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:45,621 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:45,621 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:45,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,624 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:45,625 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:45,625 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:45,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,629 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:45,630 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:45,630 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:45,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,633 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:45,634 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:45,634 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:45,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,639 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:45,641 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:45,641 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:45,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,650 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:45,652 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:45,652 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:45,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,662 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:45,663 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:45,663 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:45,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:45,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,665 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:45,666 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:45,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:45,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:45,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,667 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:45,668 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:45,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:45,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,669 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:45,670 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:45,670 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:45,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:45,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,674 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:45,674 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:45,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:45,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:45,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,676 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:45,676 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:45,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:45,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:45,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,678 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:45,679 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:45,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:45,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:45,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,680 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:45,681 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:45,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:45,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:45,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,682 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:45,682 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:45,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:45,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:45,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,728 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:45,728 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:45,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:45,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,729 INFO L497 LassoAnalysis]: Using template '3-nested'. [2020-06-22 10:18:45,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:45,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,730 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:45,730 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:45,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:45,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,732 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:45,732 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:45,733 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:45,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,736 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:45,739 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:45,739 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:45,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,766 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:45,767 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:45,767 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:45,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,770 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:45,772 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:45,772 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:45,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,781 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:45,782 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:45,782 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:45,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,784 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:45,785 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:45,785 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:45,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,789 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:45,790 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:45,790 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:45,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,795 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:45,795 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:45,796 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:45,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,798 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:45,799 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:45,800 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:45,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,806 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:45,808 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:45,808 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:45,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,816 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:45,818 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:45,818 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:45,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,828 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:45,828 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:45,829 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:45,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:45,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,832 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:45,832 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:45,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:45,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:45,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,833 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:45,834 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:45,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:45,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,835 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:45,836 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:45,836 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:45,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:45,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,839 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:45,839 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:45,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:45,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:45,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,841 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:45,841 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:45,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:45,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:45,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,843 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:45,843 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:45,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:45,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:45,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,845 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:45,845 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:45,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:45,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:45,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,846 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:45,847 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:45,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:45,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:45,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,848 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:45,849 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:45,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:45,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,849 INFO L497 LassoAnalysis]: Using template '4-nested'. [2020-06-22 10:18:45,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:45,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,850 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:45,851 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 10:18:45,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:45,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,852 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:45,853 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:45,853 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:45,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,856 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:45,860 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:45,860 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:45,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,888 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:45,889 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:45,889 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:45,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,892 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:45,894 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:45,894 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:45,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,904 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:45,905 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:45,906 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:45,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,908 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:45,909 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:45,909 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:45,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,913 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:45,915 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:45,915 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:45,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,919 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:45,920 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:45,921 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:45,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,923 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:45,925 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:45,925 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:45,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,932 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:45,934 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:45,934 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:45,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,944 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:45,946 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:45,946 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:45,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,958 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:45,959 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:45,959 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:45,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:45,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,962 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:45,963 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 10:18:45,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:45,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:45,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,964 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:45,965 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 10:18:45,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:45,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,966 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:45,967 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:45,967 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:45,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:45,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,971 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:45,971 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 10:18:45,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:45,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:45,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,973 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:45,973 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 10:18:45,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:45,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:45,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,975 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:45,975 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 10:18:45,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:45,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:45,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,977 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:45,977 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 10:18:45,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:45,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:45,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,979 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:45,979 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 10:18:45,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:45,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:45,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:45,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,980 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:45,981 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 10:18:45,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:45,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,982 INFO L497 LassoAnalysis]: Using template '2-phase'. [2020-06-22 10:18:45,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,982 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:45,982 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:45,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:45,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,983 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:45,983 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:45,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:45,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,984 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:45,984 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:45,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,985 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:45,986 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:45,986 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:45,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:45,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:45,989 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:45,989 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:45,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:45,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:45,989 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:45,992 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:45,992 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:46,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,089 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,089 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:46,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,090 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:46,091 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:46,091 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:46,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,094 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,094 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:46,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,094 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:46,096 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:46,096 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:46,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,104 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,104 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:46,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,104 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:46,105 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:46,105 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:46,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,108 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,108 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:46,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,109 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:46,109 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:46,109 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:46,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,113 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,113 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:46,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,113 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:46,114 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:46,114 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:46,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,118 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,118 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:46,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,119 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:46,120 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:46,120 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:46,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,123 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,123 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:46,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,123 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:46,124 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:46,124 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:46,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,130 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,130 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:46,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,131 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:46,132 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:46,132 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:46,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,140 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,140 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:46,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,141 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:46,143 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:46,143 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:46,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,152 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,152 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:46,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,152 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:46,153 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:46,153 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:46,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,156 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,156 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:46,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:46,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,157 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:46,157 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:46,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:46,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,159 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,159 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:46,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:46,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,159 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:46,160 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:46,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:46,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,161 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,161 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:46,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,162 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:46,162 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:46,163 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:46,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,165 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,166 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:46,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:46,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,166 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:46,166 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:46,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:46,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,168 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,168 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:46,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:46,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,168 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:46,169 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:46,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:46,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,170 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,170 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:46,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:46,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,171 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:46,171 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:46,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:46,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,172 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,172 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:46,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:46,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,173 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:46,173 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:46,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:46,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,175 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,175 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:46,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:46,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,175 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:46,175 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:46,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:46,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,177 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,177 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:46,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:46,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,177 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:46,178 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:46,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:46,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,179 INFO L497 LassoAnalysis]: Using template '3-phase'. [2020-06-22 10:18:46,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,179 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,179 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:46,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:46,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,180 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:46,180 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:46,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:46,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,182 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,182 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:46,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,183 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:46,184 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:46,184 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:46,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,187 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,187 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:46,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,188 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:46,192 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:46,192 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:46,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,357 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,357 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:46,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,358 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:46,359 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:46,359 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:46,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,363 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,363 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:46,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,363 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:46,365 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:46,365 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:46,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,377 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,377 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:46,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,377 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:46,378 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:46,378 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:46,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,382 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,382 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:46,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,382 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:46,383 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:46,384 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:46,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,388 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,388 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:46,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,389 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:46,390 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:46,390 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:46,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,396 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,396 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:46,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,396 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:46,397 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:46,398 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:46,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,401 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,401 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:46,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,402 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:46,403 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:46,403 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:46,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,411 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,411 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:46,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,411 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:46,413 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:46,413 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:46,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,427 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,427 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:46,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,428 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:46,430 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:46,430 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:46,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,443 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,443 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:46,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,444 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:46,445 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:46,445 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:46,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,448 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,448 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:46,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:46,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,449 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:46,449 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:46,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:46,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,451 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,451 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:46,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:46,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,452 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:46,452 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:46,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:46,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,454 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,454 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:46,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,455 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:46,456 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:46,456 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:46,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,459 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,459 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:46,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:46,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,460 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:46,460 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:46,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:46,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,462 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,462 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:46,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:46,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,463 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:46,463 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:46,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:46,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,465 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,465 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:46,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:46,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,465 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:46,466 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:46,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:46,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,468 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,468 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:46,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:46,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,468 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:46,469 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:46,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:46,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,471 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,471 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:46,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:46,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,471 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:46,472 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:46,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:46,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,474 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,474 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:46,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:46,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,474 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:46,475 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:46,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:46,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,476 INFO L497 LassoAnalysis]: Using template '4-phase'. [2020-06-22 10:18:46,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,477 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,477 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:46,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:46,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,477 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:46,478 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 10:18:46,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:46,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,479 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,479 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:46,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,480 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:46,481 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:46,481 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:46,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:46,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:46,487 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:46,487 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:46,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:46,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:46,488 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:46,494 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:46,494 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:47,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,023 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,023 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,023 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:47,025 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:47,025 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:47,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,031 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,031 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,031 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:47,034 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:47,034 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:47,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,052 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,052 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,052 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:47,054 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:47,054 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:47,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,059 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,060 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,060 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:47,061 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:47,062 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:47,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,068 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,068 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,068 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:47,070 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:47,070 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:47,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,078 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,078 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,078 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:47,080 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:47,080 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:47,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,085 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,085 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,086 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:47,088 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:47,088 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:47,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,098 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,099 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,099 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:47,102 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:47,102 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:47,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,116 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,117 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,117 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:47,120 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:47,120 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:47,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,138 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,138 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,138 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:47,140 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:47,140 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:47,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,145 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,145 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:47,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,146 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:47,147 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 10:18:47,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:47,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,148 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,148 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:47,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,149 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:47,150 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 10:18:47,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:47,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,151 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,151 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,152 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:47,153 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:47,153 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:47,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,159 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,159 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:47,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,159 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:47,160 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 10:18:47,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:47,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,161 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,162 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:47,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,162 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:47,163 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 10:18:47,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:47,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,164 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,164 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:47,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,165 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:47,166 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 10:18:47,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:47,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,167 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,167 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:47,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,168 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:47,169 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 10:18:47,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:47,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,170 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,170 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:47,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,171 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:47,171 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 10:18:47,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:47,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,173 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,173 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:47,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,174 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:47,174 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 10:18:47,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:47,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,175 INFO L497 LassoAnalysis]: Using template '2-lex'. [2020-06-22 10:18:47,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,176 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,176 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:47,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:47,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,177 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:47,177 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:47,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:47,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,179 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,179 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:47,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,179 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:47,180 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:47,180 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:47,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,184 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,184 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:47,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,184 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:47,187 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:47,187 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:47,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,270 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,270 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:47,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,271 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:47,272 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:47,272 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:47,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,275 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,275 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:47,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,276 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:47,277 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:47,277 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:47,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,286 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,286 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:47,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,287 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:47,288 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:47,288 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:47,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,291 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,291 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:47,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,291 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:47,292 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:47,292 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:47,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,296 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,296 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:47,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,296 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:47,297 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:47,298 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:47,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,302 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,302 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:47,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,302 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:47,303 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:47,303 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:47,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,306 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,307 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:47,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,307 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:47,308 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:47,308 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:47,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,316 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,316 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:47,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,317 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:47,318 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:47,318 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:47,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,330 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,330 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:47,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,330 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:47,332 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:47,332 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:47,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,345 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,345 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:47,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,345 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:47,346 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:47,346 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:47,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,349 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,350 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:47,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:47,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,350 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:47,350 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:47,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:47,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,352 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,353 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:47,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:47,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,353 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:47,353 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:47,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:47,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,355 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,355 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:47,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,356 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:47,356 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:47,357 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:47,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,360 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,360 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:47,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:47,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,360 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:47,361 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:47,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:47,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,362 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,362 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:47,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:47,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,363 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:47,363 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:47,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:47,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,365 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,365 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:47,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:47,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,366 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:47,366 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:47,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:47,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,368 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,368 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:47,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:47,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,368 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:47,369 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:47,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:47,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,371 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,371 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:47,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:47,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,371 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:47,371 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:47,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:47,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,373 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,373 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:47,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:47,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,374 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:47,374 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:47,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:47,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,375 INFO L497 LassoAnalysis]: Using template '3-lex'. [2020-06-22 10:18:47,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,376 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,376 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:47,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,377 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:47,377 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:47,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:47,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,379 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,379 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,380 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:47,381 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 10:18:47,381 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 10:18:47,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,386 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,386 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,386 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:47,391 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 10:18:47,391 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 10:18:47,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,788 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,788 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,789 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:47,790 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 10:18:47,790 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 10:18:47,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,795 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,795 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,795 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:47,798 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 10:18:47,798 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 10:18:47,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,812 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,812 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,812 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:47,814 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 10:18:47,814 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 10:18:47,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,819 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,819 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,819 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:47,820 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 10:18:47,821 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 10:18:47,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,826 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,826 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,826 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:47,828 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 10:18:47,828 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 10:18:47,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,834 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,834 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,834 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:47,835 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 10:18:47,835 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 10:18:47,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,840 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,840 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,841 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:47,842 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 10:18:47,842 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 10:18:47,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,854 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,854 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,854 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:47,857 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 10:18:47,857 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 10:18:47,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,876 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,876 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,877 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:47,879 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 10:18:47,880 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 10:18:47,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,903 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,904 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,904 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:47,905 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 10:18:47,905 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 10:18:47,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,910 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,910 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:47,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,911 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:47,911 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:47,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:47,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,914 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,914 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:47,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,915 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:47,915 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:47,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:47,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,917 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,918 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,918 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:47,919 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 10:18:47,919 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 10:18:47,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,923 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,924 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:47,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,924 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:47,924 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:47,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:47,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,927 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,927 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:47,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,927 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:47,928 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:47,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:47,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,930 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,930 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:47,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,931 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:47,931 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:47,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:47,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,933 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,933 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:47,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,934 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:47,934 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:47,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:47,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,936 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,936 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:47,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,937 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:47,937 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:47,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:47,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:47,940 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:47,940 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:47,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:47,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:47,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:47,940 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:47,940 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:47,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:47,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:47,942 INFO L488 BuchiCegarLoop]: Result of lasso check was UNKNOWN. I will concatenate loop to stem and try again. [2020-06-22 10:18:47,944 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 [2020-06-22 10:18:47,944 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 [2020-06-22 10:18:47,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:18:47,944 INFO L82 PathProgramCache]: Analyzing trace with hash -604128316, now seen corresponding path program 2 times [2020-06-22 10:18:47,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:18:47,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:18:47,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:47,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:18:47,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:47,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:47,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:18:47,966 INFO L82 PathProgramCache]: Analyzing trace with hash 5620745, now seen corresponding path program 3 times [2020-06-22 10:18:47,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:18:47,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:18:47,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:47,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:18:47,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:47,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:18:47,971 INFO L82 PathProgramCache]: Analyzing trace with hash -340138420, now seen corresponding path program 3 times [2020-06-22 10:18:47,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:18:47,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:18:47,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:47,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:18:47,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:48,541 WARN L188 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 124 [2020-06-22 10:18:48,699 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-06-22 10:18:48,701 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:18:48,701 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:18:48,701 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:18:48,701 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:18:48,702 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:18:48,702 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:18:48,702 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:18:48,702 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:18:48,702 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso [2020-06-22 10:18:48,702 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:18:48,702 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:18:48,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:48,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:48,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:49,042 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2020-06-22 10:18:49,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:49,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:49,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:49,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:49,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:49,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:49,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:49,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:49,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:49,438 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:18:49,438 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:18:49,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:49,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:49,439 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:18:49,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:49,440 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:49,441 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:49,441 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:49,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:49,443 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:49,444 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:49,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:49,446 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:49,446 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:49,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:49,448 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:49,448 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:49,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:49,453 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:49,453 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:49,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:49,456 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:49,456 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:49,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:49,461 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:49,461 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:49,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:49,463 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:49,463 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:49,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:49,467 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:49,467 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:49,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:49,472 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:49,472 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:49,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:49,475 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:49,476 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:49,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:49,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:49,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:18:49,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:49,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:49,499 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:49,499 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:49,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:49,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:49,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:18:49,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:49,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:49,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:49,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:18:49,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:49,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:49,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:49,504 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:18:49,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:49,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:49,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:49,505 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:18:49,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:49,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:49,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:49,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:18:49,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:49,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:49,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:49,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:18:49,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:49,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:49,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:49,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:18:49,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:49,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,510 INFO L497 LassoAnalysis]: Using template '2-nested'. [2020-06-22 10:18:49,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:49,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,511 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:49,511 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:49,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:49,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,512 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:49,513 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:49,513 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:49,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,515 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:49,515 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:49,515 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:49,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,517 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:49,518 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:49,518 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:49,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,519 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:49,521 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:49,521 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:49,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,527 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:49,528 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:49,528 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:49,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,530 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:49,531 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:49,531 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:49,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,537 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:49,538 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:49,538 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:49,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,540 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:49,540 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:49,540 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:49,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,544 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:49,545 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:49,545 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:49,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,551 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:49,551 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:49,552 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:49,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,554 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:49,556 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:49,556 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:49,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:49,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,573 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:49,573 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:49,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:49,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,575 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:49,575 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:49,575 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:49,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:49,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,577 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:49,577 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:49,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:49,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:49,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,579 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:49,579 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:49,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:49,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:49,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,580 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:49,580 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:49,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:49,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:49,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,582 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:49,582 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:49,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:49,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:49,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,583 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:49,584 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:49,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:49,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:49,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,585 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:49,585 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:49,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:49,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:49,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,587 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:49,587 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:49,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:49,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,587 INFO L497 LassoAnalysis]: Using template '3-nested'. [2020-06-22 10:18:49,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:49,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,588 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:49,588 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:49,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:49,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,590 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:49,590 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:49,590 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:49,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,593 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:49,594 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:49,594 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:49,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,596 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:49,597 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:49,597 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:49,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,599 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:49,600 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:49,600 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:49,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,608 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:49,609 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:49,609 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:49,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,612 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:49,614 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:49,614 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:49,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,621 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:49,623 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:49,623 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:49,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,625 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:49,626 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:49,626 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:49,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,632 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:49,633 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:49,633 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:49,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,640 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:49,641 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:49,641 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:49,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,644 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:49,646 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:49,646 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:49,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:49,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,678 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:49,679 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:49,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:49,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,680 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:49,681 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:49,681 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:49,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:49,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,683 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:49,684 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:49,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:49,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:49,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,685 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:49,685 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:49,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:49,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:49,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,686 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:49,687 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:49,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:49,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:49,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,688 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:49,688 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:49,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:49,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:49,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,690 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:49,690 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:49,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:49,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:49,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,691 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:49,692 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:49,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:49,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:49,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,693 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:49,693 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:49,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:49,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,694 INFO L497 LassoAnalysis]: Using template '4-nested'. [2020-06-22 10:18:49,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:49,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,695 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:49,695 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 10:18:49,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:49,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,696 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:49,697 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:49,697 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:49,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,700 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:49,700 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:49,701 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:49,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,703 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:49,704 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:49,704 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:49,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,707 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:49,708 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:49,708 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:49,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,718 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:49,718 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:49,719 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:49,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,722 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:49,723 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:49,724 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:49,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,733 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:49,733 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:49,734 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:49,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,736 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:49,737 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:49,737 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:49,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,743 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:49,744 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:49,745 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:49,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,753 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:49,754 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:49,754 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:49,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,757 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:49,760 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:49,760 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:49,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:49,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,793 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:49,793 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 10:18:49,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:49,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,795 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:49,795 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:49,796 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:49,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:49,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,798 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:49,798 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 10:18:49,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:49,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:49,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,800 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:49,800 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 10:18:49,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:49,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:49,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,802 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:49,802 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 10:18:49,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:49,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:49,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,804 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:49,804 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 10:18:49,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:49,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:49,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,805 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:49,806 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 10:18:49,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:49,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:49,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,807 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:49,807 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 10:18:49,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:49,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:49,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:49,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,809 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:49,809 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 10:18:49,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:49,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,810 INFO L497 LassoAnalysis]: Using template '2-phase'. [2020-06-22 10:18:49,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,810 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:49,810 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:49,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:49,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,811 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:49,811 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:49,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:49,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,812 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:49,812 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:49,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,813 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:49,813 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:49,814 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:49,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,816 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:49,816 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:49,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,816 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:49,817 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:49,817 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:49,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,819 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:49,820 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:49,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,820 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:49,821 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:49,821 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:49,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,823 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:49,823 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:49,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,824 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:49,825 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:49,825 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:49,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,833 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:49,833 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:49,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,833 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:49,834 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:49,834 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:49,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,954 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:49,954 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:49,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,955 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:49,956 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:49,956 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:49,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,964 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:49,964 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:49,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,965 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:49,965 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:49,965 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:49,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,968 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:49,968 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:49,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,968 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:49,969 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:49,969 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:49,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,974 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:49,974 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:49,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,974 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:49,975 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:49,976 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:49,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,982 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:49,982 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:49,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,982 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:49,983 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:49,983 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:49,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:49,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:49,986 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:49,986 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:49,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:49,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:49,987 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:49,989 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:49,989 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:50,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,063 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,063 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:50,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:50,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,064 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:50,064 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:50,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:50,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,065 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,065 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:50,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,066 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:50,066 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:18:50,067 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:18:50,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,069 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,069 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:50,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:50,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,070 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:50,070 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:50,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:50,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,071 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,071 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:50,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:50,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,072 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:50,072 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:50,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:50,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,073 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,073 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:50,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:50,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,074 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:50,074 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:50,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:50,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,075 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,075 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:50,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:50,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,076 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:50,076 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:50,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:50,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,077 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,077 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:50,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:50,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,077 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:50,078 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:50,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:50,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,079 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,079 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:50,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:50,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,079 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:50,080 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:50,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:50,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,081 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,081 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:50,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:50,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,081 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:50,082 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:50,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:50,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,082 INFO L497 LassoAnalysis]: Using template '3-phase'. [2020-06-22 10:18:50,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,083 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,083 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:50,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:50,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,084 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:50,084 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:50,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:50,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,086 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,086 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:50,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,086 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:50,087 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:50,087 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:50,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,090 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,090 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:50,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,090 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:50,091 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:50,091 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:50,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,094 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,094 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:50,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,095 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:50,095 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:50,096 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:50,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,098 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,099 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:50,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,099 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:50,101 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:50,101 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:50,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,114 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,114 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:50,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,114 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:50,115 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:50,115 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:50,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,119 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,119 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:50,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,120 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:50,122 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:50,122 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:50,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,132 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,132 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:50,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,132 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:50,133 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:50,133 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:50,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,136 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,136 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:50,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,137 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:50,138 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:50,138 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:50,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,144 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,144 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:50,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,145 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:50,147 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:50,147 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:50,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,156 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,156 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:50,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,156 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:50,157 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:50,157 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:50,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,161 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,161 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:50,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,161 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:50,165 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:50,165 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:50,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,383 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,383 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:50,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:50,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,383 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:50,384 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:50,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:50,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,385 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,386 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:50,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,386 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:50,387 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:50,387 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:50,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,390 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,390 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:50,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:50,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,391 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:50,391 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:50,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:50,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,392 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,393 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:50,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:50,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,393 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:50,393 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:50,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:50,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,395 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,395 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:50,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:50,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,396 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:50,396 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:50,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:50,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,398 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,398 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:50,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:50,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,398 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:50,399 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:50,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:50,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,400 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,400 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:50,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:50,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,401 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:50,401 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:50,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:50,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,403 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,403 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:50,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:50,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,404 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:50,404 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:50,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:50,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,406 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,406 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 10:18:50,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:50,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,406 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:50,407 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:50,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:50,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,408 INFO L497 LassoAnalysis]: Using template '4-phase'. [2020-06-22 10:18:50,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,409 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,409 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:50,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:50,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,409 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:50,410 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 10:18:50,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:50,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,411 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,411 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:50,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,412 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:50,413 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:50,413 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:50,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,418 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,418 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:50,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,419 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:50,420 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:50,420 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:50,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,425 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,425 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:50,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,426 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:50,427 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:50,427 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:50,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,432 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,432 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:50,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,432 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:50,435 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:50,435 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:50,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,451 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,451 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:50,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,451 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:50,453 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:50,453 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:50,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,458 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,458 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:50,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,459 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:50,461 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:50,462 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:50,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,483 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,483 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:50,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,483 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:50,485 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:50,485 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:50,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,489 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,489 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:50,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,490 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:50,491 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:50,492 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:50,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,500 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,500 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:50,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,501 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:50,503 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:50,504 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:50,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,517 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,517 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:50,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,518 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:50,519 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:50,519 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:50,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:50,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:50,525 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:50,526 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:50,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:50,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:50,526 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:50,531 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:50,532 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:51,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,213 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,213 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:51,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:51,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,214 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:51,214 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 10:18:51,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:51,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,216 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,216 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:51,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,216 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:51,218 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 10:18:51,218 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 10:18:51,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,223 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,223 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:51,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:51,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,224 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:51,224 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 10:18:51,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:51,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,226 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,226 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:51,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:51,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,226 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:51,227 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 10:18:51,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:51,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,228 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,228 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:51,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:51,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,229 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:51,229 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 10:18:51,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:51,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,231 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,231 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:51,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:51,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,232 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:51,232 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 10:18:51,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:51,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,234 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,234 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:51,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:51,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,234 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:51,235 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 10:18:51,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:51,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,236 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,236 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:51,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:51,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,237 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:51,237 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 10:18:51,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:51,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,239 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,239 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:51,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:51,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,239 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 10:18:51,240 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 10:18:51,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:51,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,241 INFO L497 LassoAnalysis]: Using template '2-lex'. [2020-06-22 10:18:51,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,241 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,241 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:51,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:51,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,242 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:51,242 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:51,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:51,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,244 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,244 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:51,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,244 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:51,245 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:51,245 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:51,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,248 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,248 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:51,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,248 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:51,249 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:51,249 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:51,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,252 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,252 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:51,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,252 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:51,253 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:51,253 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:51,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,256 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,256 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:51,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,256 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:51,258 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:51,258 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:51,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,268 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,269 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:51,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,269 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:51,270 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:51,270 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:51,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,273 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,273 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:51,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,273 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:51,275 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:51,275 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:51,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,290 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,290 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:51,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,290 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:51,291 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:51,291 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:51,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,294 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,294 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:51,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,295 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:51,296 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:51,296 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:51,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,301 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,302 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:51,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,302 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:51,303 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:51,303 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:51,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,311 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,311 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:51,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,311 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:51,312 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:51,312 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:51,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,315 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,316 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:51,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,316 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:51,319 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:51,319 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:51,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,424 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,424 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:51,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:51,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,425 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:51,425 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:51,425 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:51,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,426 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,427 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:51,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,427 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:51,428 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:18:51,428 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:18:51,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,431 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,431 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:51,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:51,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,431 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:51,431 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:51,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:51,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,433 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,433 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:51,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:51,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,434 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:51,434 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:51,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:51,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,436 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,436 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:51,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:51,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,436 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:51,436 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:51,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:51,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,438 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,438 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:51,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:51,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,439 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:51,439 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:51,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:51,440 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,441 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,441 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,441 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:51,441 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:51,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,441 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:51,442 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:51,442 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:51,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,443 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,443 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:51,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:51,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,444 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:51,444 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:51,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:51,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,446 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,446 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 10:18:51,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:51,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,446 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:18:51,447 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:18:51,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:51,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,448 INFO L497 LassoAnalysis]: Using template '3-lex'. [2020-06-22 10:18:51,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,448 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,448 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:51,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:51,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,449 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:51,449 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:51,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:51,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,451 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,451 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:51,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,452 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:51,453 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 10:18:51,453 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 10:18:51,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,457 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,457 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:51,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,457 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:51,458 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 10:18:51,458 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 10:18:51,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,462 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,462 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:51,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,463 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:51,464 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 10:18:51,464 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 10:18:51,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,468 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,468 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:51,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,468 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:51,471 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 10:18:51,471 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 10:18:51,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,494 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,494 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:51,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,495 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:51,496 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 10:18:51,496 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 10:18:51,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,500 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,500 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:51,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,501 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:51,503 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 10:18:51,503 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 10:18:51,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,531 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,531 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:51,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,532 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:51,533 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 10:18:51,533 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 10:18:51,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,537 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,537 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:51,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,537 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:51,539 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 10:18:51,539 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 10:18:51,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,548 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,548 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:51,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,548 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:51,550 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 10:18:51,551 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 10:18:51,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,561 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,561 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:51,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,562 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:51,563 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 10:18:51,563 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 10:18:51,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,568 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,568 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:51,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,568 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:51,573 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 10:18:51,573 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 10:18:51,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,914 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,914 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:51,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:51,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,915 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:51,915 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:51,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:51,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,917 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,917 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:51,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,917 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:51,919 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 10:18:51,919 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 10:18:51,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,922 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,922 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:51,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:51,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,923 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:51,923 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:51,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:51,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,925 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,925 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:51,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:51,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,926 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:51,926 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:51,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:51,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,928 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,928 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:51,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:51,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,929 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:51,929 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:51,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:51,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,932 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,932 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:51,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:51,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,932 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:51,933 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:51,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:51,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,935 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,935 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:51,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:51,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,935 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:51,936 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:51,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:51,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,937 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,938 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,938 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:51,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:51,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,938 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:51,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:51,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:51,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:51,941 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 10:18:51,941 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 10:18:51,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:51,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:51,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:51,941 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 10:18:51,942 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:51,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:51,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:51,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:18:51 BasicIcfg [2020-06-22 10:18:51,951 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 10:18:51,952 INFO L168 Benchmark]: Toolchain (without parser) took 71449.24 ms. Allocated memory was 649.6 MB in the beginning and 1.3 GB in the end (delta: 643.3 MB). Free memory was 565.2 MB in the beginning and 326.7 MB in the end (delta: 238.6 MB). Peak memory consumption was 886.5 MB. Max. memory is 50.3 GB. [2020-06-22 10:18:51,952 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 586.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:18:51,953 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.22 ms. Allocated memory was 649.6 MB in the beginning and 671.1 MB in the end (delta: 21.5 MB). Free memory was 565.2 MB in the beginning and 634.5 MB in the end (delta: -69.3 MB). Peak memory consumption was 30.0 MB. Max. memory is 50.3 GB. [2020-06-22 10:18:51,953 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.27 ms. Allocated memory is still 671.1 MB. Free memory was 634.5 MB in the beginning and 631.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-06-22 10:18:51,953 INFO L168 Benchmark]: Boogie Preprocessor took 28.16 ms. Allocated memory is still 671.1 MB. Free memory was 631.8 MB in the beginning and 630.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 10:18:51,954 INFO L168 Benchmark]: RCFGBuilder took 313.12 ms. Allocated memory is still 671.1 MB. Free memory was 630.5 MB in the beginning and 608.1 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 50.3 GB. [2020-06-22 10:18:51,954 INFO L168 Benchmark]: BlockEncodingV2 took 116.15 ms. Allocated memory is still 671.1 MB. Free memory was 608.1 MB in the beginning and 600.0 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:18:51,954 INFO L168 Benchmark]: TraceAbstraction took 60423.10 ms. Allocated memory was 671.1 MB in the beginning and 988.8 MB in the end (delta: 317.7 MB). Free memory was 600.0 MB in the beginning and 589.2 MB in the end (delta: 10.8 MB). Peak memory consumption was 550.0 MB. Max. memory is 50.3 GB. [2020-06-22 10:18:51,955 INFO L168 Benchmark]: BuchiAutomizer took 10199.85 ms. Allocated memory was 988.8 MB in the beginning and 1.3 GB in the end (delta: 304.1 MB). Free memory was 589.2 MB in the beginning and 326.7 MB in the end (delta: 262.5 MB). Peak memory consumption was 571.3 MB. Max. memory is 50.3 GB. [2020-06-22 10:18:51,958 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 30 locations, 36 edges - StatisticsResult: Encoded RCFG 22 locations, 39 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 586.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 322.22 ms. Allocated memory was 649.6 MB in the beginning and 671.1 MB in the end (delta: 21.5 MB). Free memory was 565.2 MB in the beginning and 634.5 MB in the end (delta: -69.3 MB). Peak memory consumption was 30.0 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 41.27 ms. Allocated memory is still 671.1 MB. Free memory was 634.5 MB in the beginning and 631.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 28.16 ms. Allocated memory is still 671.1 MB. Free memory was 631.8 MB in the beginning and 630.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 313.12 ms. Allocated memory is still 671.1 MB. Free memory was 630.5 MB in the beginning and 608.1 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 116.15 ms. Allocated memory is still 671.1 MB. Free memory was 608.1 MB in the beginning and 600.0 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. * TraceAbstraction took 60423.10 ms. Allocated memory was 671.1 MB in the beginning and 988.8 MB in the end (delta: 317.7 MB). Free memory was 600.0 MB in the beginning and 589.2 MB in the end (delta: 10.8 MB). Peak memory consumption was 550.0 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 10199.85 ms. Allocated memory was 988.8 MB in the beginning and 1.3 GB in the end (delta: 304.1 MB). Free memory was 589.2 MB in the beginning and 326.7 MB in the end (delta: 262.5 MB). Peak memory consumption was 571.3 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 45]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 45]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 44]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer arithmetic is always legal For all program executions holds that pointer arithmetic is always legal at this location - PositiveResult [Line: 44]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant [2020-06-22 10:18:51,970 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:51,970 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:51,970 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:51,971 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:51,971 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:51,971 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:51,971 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:51,972 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:51,972 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:51,972 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:18:51,973 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:18:51,973 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:51,973 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:18:51,974 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,974 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:51,975 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,975 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,975 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:51,976 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:51,976 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,976 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:51,976 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,976 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,977 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:51,977 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,977 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,977 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,977 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:51,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:51,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:51,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,979 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,979 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,979 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:51,979 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:51,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:51,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,981 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:51,981 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,981 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,981 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,982 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,982 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:51,982 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,982 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,982 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:51,982 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,983 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,983 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:51,983 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,984 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:51,984 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:51,984 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:51,985 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:51,985 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:51,985 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:51,986 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:51,986 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:51,986 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:51,987 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:18:51,987 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:18:51,987 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:51,987 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:18:51,988 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,989 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:51,989 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,989 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,989 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:51,990 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:51,990 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,990 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:51,990 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,990 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,991 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:51,991 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,991 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,991 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,991 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:51,992 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:51,992 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,992 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:51,992 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,992 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,992 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,993 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,993 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,993 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:51,993 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,994 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:51,994 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,994 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:51,994 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,994 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,995 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:51,995 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:51,995 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,085 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,085 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,085 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:52,085 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,086 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,086 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:52,086 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,086 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,086 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:52,086 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 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]) - InvariantResult [Line: 22]: Loop Invariant [2020-06-22 10:18:52,087 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:18:52,088 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:18:52,088 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:52,088 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:18:52,088 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:52,088 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:52,089 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:52,089 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:52,089 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:52,090 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:52,090 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:18:52,090 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:18:52,090 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:52,090 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:18:52,091 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:52,091 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:52,091 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:52,092 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:52,092 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,093 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,093 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:52,093 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,093 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:52,093 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,094 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,094 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,094 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,094 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,094 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,095 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:52,095 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,095 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:52,095 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,095 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:52,095 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,096 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:52,096 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,096 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,096 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:52,097 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:52,097 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,097 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,097 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:52,097 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,098 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:52,098 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,098 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,098 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:52,098 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,098 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,098 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:52,099 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,099 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,099 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,100 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:18:52,100 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:18:52,100 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:52,100 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:18:52,101 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:52,101 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:52,101 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:52,102 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:52,102 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:52,102 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:52,102 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:18:52,103 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:18:52,103 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:52,103 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:18:52,103 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:52,103 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:52,104 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:18:52,105 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:52,105 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,105 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,105 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:52,105 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,106 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:52,106 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,106 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,106 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,107 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,107 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,107 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,107 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:52,107 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,107 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:52,108 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,108 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:52,108 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,108 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:52,109 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,109 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,109 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:52,109 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:52,109 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,110 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,110 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:52,110 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,110 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:52,110 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,110 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,111 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:52,111 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,111 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,111 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:52,111 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,112 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:52,112 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 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) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 9 error locations. SAFE Result, 60.2s OverallTime, 26 OverallIterations, 4 TraceHistogramMax, 11.8s AutomataDifference, 0.0s DeadEndRemovalTime, 42.1s 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, 11.0s 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, 40.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.9s 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 - StatisticsResult: Constructed decomposition of program 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. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 9.5s. Construction of modules took 0.1s. 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.1s 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 - TerminationAnalysisResult: Unable to decide termination Buchi Automizer is unable to decide termination for the following lasso. 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]" 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]" RESULT: Ultimate could not prove your program: unable to determine termination !SESSION 2020-06-22 10:17:37.265 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 10:18:52.347 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check