./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrstr-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1db597a1-95fa-4dcc-89bc-7751c8080b10/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1db597a1-95fa-4dcc-89bc-7751c8080b10/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1db597a1-95fa-4dcc-89bc-7751c8080b10/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1db597a1-95fa-4dcc-89bc-7751c8080b10/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrstr-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1db597a1-95fa-4dcc-89bc-7751c8080b10/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1db597a1-95fa-4dcc-89bc-7751c8080b10/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a1e56cd09ec23c2fd76dcb47b6d93a02131ca6ec ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 08:13:02,708 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 08:13:02,709 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 08:13:02,716 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 08:13:02,716 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 08:13:02,717 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 08:13:02,718 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 08:13:02,719 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 08:13:02,720 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 08:13:02,720 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 08:13:02,721 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 08:13:02,721 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 08:13:02,722 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 08:13:02,722 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 08:13:02,723 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 08:13:02,724 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 08:13:02,724 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 08:13:02,726 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 08:13:02,727 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 08:13:02,728 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 08:13:02,729 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 08:13:02,729 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 08:13:02,731 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 08:13:02,731 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 08:13:02,731 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 08:13:02,732 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 08:13:02,733 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 08:13:02,733 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 08:13:02,734 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 08:13:02,735 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 08:13:02,735 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 08:13:02,735 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 08:13:02,736 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 08:13:02,736 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 08:13:02,736 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 08:13:02,737 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 08:13:02,737 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1db597a1-95fa-4dcc-89bc-7751c8080b10/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-09 08:13:02,748 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 08:13:02,748 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 08:13:02,749 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 08:13:02,749 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 08:13:02,749 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 08:13:02,749 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 08:13:02,749 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 08:13:02,750 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 08:13:02,750 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 08:13:02,750 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 08:13:02,750 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 08:13:02,750 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 08:13:02,750 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 08:13:02,750 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 08:13:02,750 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 08:13:02,750 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 08:13:02,750 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 08:13:02,751 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 08:13:02,751 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 08:13:02,751 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 08:13:02,751 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 08:13:02,751 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 08:13:02,751 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 08:13:02,751 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 08:13:02,751 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 08:13:02,752 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 08:13:02,752 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 08:13:02,752 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 08:13:02,752 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 08:13:02,752 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_1db597a1-95fa-4dcc-89bc-7751c8080b10/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a1e56cd09ec23c2fd76dcb47b6d93a02131ca6ec [2018-12-09 08:13:02,774 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 08:13:02,781 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 08:13:02,783 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 08:13:02,784 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 08:13:02,784 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 08:13:02,784 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1db597a1-95fa-4dcc-89bc-7751c8080b10/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrstr-alloca_true-termination.c.i [2018-12-09 08:13:02,818 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1db597a1-95fa-4dcc-89bc-7751c8080b10/bin-2019/uautomizer/data/6cf61cbfc/795e8f81d6c84fd2aa00a5097186fbd6/FLAGfefc9925b [2018-12-09 08:13:03,254 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 08:13:03,254 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1db597a1-95fa-4dcc-89bc-7751c8080b10/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrstr-alloca_true-termination.c.i [2018-12-09 08:13:03,260 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1db597a1-95fa-4dcc-89bc-7751c8080b10/bin-2019/uautomizer/data/6cf61cbfc/795e8f81d6c84fd2aa00a5097186fbd6/FLAGfefc9925b [2018-12-09 08:13:03,269 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1db597a1-95fa-4dcc-89bc-7751c8080b10/bin-2019/uautomizer/data/6cf61cbfc/795e8f81d6c84fd2aa00a5097186fbd6 [2018-12-09 08:13:03,270 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 08:13:03,271 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 08:13:03,272 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 08:13:03,272 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 08:13:03,274 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 08:13:03,274 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:13:03" (1/1) ... [2018-12-09 08:13:03,276 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7014c445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:03, skipping insertion in model container [2018-12-09 08:13:03,276 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:13:03" (1/1) ... [2018-12-09 08:13:03,280 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 08:13:03,299 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 08:13:03,446 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 08:13:03,487 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 08:13:03,516 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 08:13:03,541 INFO L195 MainTranslator]: Completed translation [2018-12-09 08:13:03,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:03 WrapperNode [2018-12-09 08:13:03,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 08:13:03,542 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 08:13:03,542 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 08:13:03,542 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 08:13:03,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:03" (1/1) ... [2018-12-09 08:13:03,555 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:03" (1/1) ... [2018-12-09 08:13:03,569 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 08:13:03,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 08:13:03,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 08:13:03,570 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 08:13:03,575 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:03" (1/1) ... [2018-12-09 08:13:03,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:03" (1/1) ... [2018-12-09 08:13:03,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:03" (1/1) ... [2018-12-09 08:13:03,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:03" (1/1) ... [2018-12-09 08:13:03,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:03" (1/1) ... [2018-12-09 08:13:03,585 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:03" (1/1) ... [2018-12-09 08:13:03,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:03" (1/1) ... [2018-12-09 08:13:03,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 08:13:03,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 08:13:03,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 08:13:03,588 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 08:13:03,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1db597a1-95fa-4dcc-89bc-7751c8080b10/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 08:13:03,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 08:13:03,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 08:13:03,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 08:13:03,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 08:13:03,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 08:13:03,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 08:13:03,792 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 08:13:03,793 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-12-09 08:13:03,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:13:03 BoogieIcfgContainer [2018-12-09 08:13:03,793 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 08:13:03,793 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 08:13:03,793 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 08:13:03,795 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 08:13:03,796 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 08:13:03,796 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 08:13:03" (1/3) ... [2018-12-09 08:13:03,796 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68f50e4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 08:13:03, skipping insertion in model container [2018-12-09 08:13:03,796 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 08:13:03,797 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:03" (2/3) ... [2018-12-09 08:13:03,797 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68f50e4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 08:13:03, skipping insertion in model container [2018-12-09 08:13:03,797 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 08:13:03,797 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:13:03" (3/3) ... [2018-12-09 08:13:03,798 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrstr-alloca_true-termination.c.i [2018-12-09 08:13:03,832 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 08:13:03,832 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 08:13:03,832 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 08:13:03,832 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 08:13:03,832 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 08:13:03,832 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 08:13:03,833 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 08:13:03,833 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 08:13:03,833 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 08:13:03,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2018-12-09 08:13:03,854 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-12-09 08:13:03,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 08:13:03,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 08:13:03,858 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-09 08:13:03,858 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 08:13:03,858 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 08:13:03,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2018-12-09 08:13:03,859 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-12-09 08:13:03,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 08:13:03,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 08:13:03,860 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-09 08:13:03,860 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 08:13:03,864 INFO L794 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 3#L588true assume !(main_~length1~0 < 1); 6#L588-2true assume !(main_~length2~0 < 1); 15#L591-1true call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 27#L573true assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 18#L551-4true [2018-12-09 08:13:03,865 INFO L796 eck$LassoCheckResult]: Loop: 18#L551-4true call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 29#L551-1true assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 14#L551-3true cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 18#L551-4true [2018-12-09 08:13:03,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:03,868 INFO L82 PathProgramCache]: Analyzing trace with hash 889572236, now seen corresponding path program 1 times [2018-12-09 08:13:03,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:13:03,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:13:03,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:03,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:13:03,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:03,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:03,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:03,960 INFO L82 PathProgramCache]: Analyzing trace with hash 51799, now seen corresponding path program 1 times [2018-12-09 08:13:03,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:13:03,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:13:03,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:03,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:13:03,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:03,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:03,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:03,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1298288364, now seen corresponding path program 1 times [2018-12-09 08:13:03,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:13:03,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:13:03,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:03,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:13:03,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:04,295 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 107 [2018-12-09 08:13:04,399 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 08:13:04,400 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 08:13:04,400 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 08:13:04,400 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 08:13:04,400 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 08:13:04,400 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 08:13:04,400 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 08:13:04,401 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 08:13:04,401 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-termination.c.i_Iteration1_Lasso [2018-12-09 08:13:04,401 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 08:13:04,401 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 08:13:04,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:04,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:04,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:04,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:04,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:04,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:04,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:04,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:04,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:04,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:04,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:04,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:04,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:04,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:04,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:04,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:04,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:04,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:04,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:04,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:04,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:04,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:04,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:04,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:04,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:04,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:04,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:04,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:04,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:04,660 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2018-12-09 08:13:05,026 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 08:13:05,030 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 08:13:05,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:05,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:05,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:05,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:05,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:05,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:05,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:05,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:05,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:05,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:05,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:05,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:05,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:05,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:05,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:05,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:05,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:05,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:05,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:05,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:05,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:05,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:05,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:05,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:05,040 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:05,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:05,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:05,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:05,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:05,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:05,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:05,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:05,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:05,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:05,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:05,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:05,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:05,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:05,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:05,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:05,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:05,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:05,043 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:05,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:05,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:05,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:05,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:05,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:05,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:05,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:05,046 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:13:05,046 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:05,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:05,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:05,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:05,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:05,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:05,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:05,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:05,050 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:05,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:05,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:05,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:05,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:05,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:05,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:05,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:05,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:05,053 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:05,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:05,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:05,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:05,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:05,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:05,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:05,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:05,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:05,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:05,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:05,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:05,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:05,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:05,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:05,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:05,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:05,059 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:13:05,059 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:05,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:05,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 [2018-12-09 08:13:05,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:05,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:05,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:05,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:05,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:05,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:05,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:05,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:05,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 [2018-12-09 08:13:05,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:05,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:05,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:05,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:05,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:05,066 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:05,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:05,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:05,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 [2018-12-09 08:13:05,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:05,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:05,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:05,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:05,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:05,068 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:05,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:05,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:05,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 [2018-12-09 08:13:05,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:05,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:05,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:05,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:05,071 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:13:05,071 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:05,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:05,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:05,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:05,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:05,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:05,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:05,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:05,075 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:05,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:05,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:05,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:05,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:05,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:05,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:05,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:05,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:05,077 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:05,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:05,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:05,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 [2018-12-09 08:13:05,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:05,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:05,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:05,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:05,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:05,080 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:05,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:05,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:05,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 [2018-12-09 08:13:05,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:05,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:05,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:05,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:05,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:05,082 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:05,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:05,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:05,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 [2018-12-09 08:13:05,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:05,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:05,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:05,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:05,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:05,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:05,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:05,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:05,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 [2018-12-09 08:13:05,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:05,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:05,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:05,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:05,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:05,087 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:05,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:05,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:05,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:05,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:05,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:05,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:05,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:05,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:05,089 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:05,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:05,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:05,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:05,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:05,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:05,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:05,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:05,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:05,091 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:05,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:05,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:05,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:05,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:05,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:05,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:05,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:05,093 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:13:05,093 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:05,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:05,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:05,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:05,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:05,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:05,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:05,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:05,097 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:05,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:05,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:05,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:05,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:05,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:05,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:05,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:05,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:05,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:05,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:05,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:05,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:05,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:05,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:05,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:05,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:05,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:05,100 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:05,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:05,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:05,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:05,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:05,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:05,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:05,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:05,102 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:13:05,102 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:05,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:05,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:05,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:05,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:05,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:05,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:05,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:05,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:05,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:05,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:05,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 [2018-12-09 08:13:05,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:05,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:05,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:05,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:05,110 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:13:05,110 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:05,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:05,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:05,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:05,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:05,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:05,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:05,115 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:13:05,115 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:05,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:05,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 [2018-12-09 08:13:05,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:05,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:05,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:05,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:05,121 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:13:05,121 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:05,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:05,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 [2018-12-09 08:13:05,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:05,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:05,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:05,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:05,133 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:13:05,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:05,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:05,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:05,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:05,136 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 08:13:05,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:05,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:05,137 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 08:13:05,138 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:05,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:05,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:05,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:05,143 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 08:13:05,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:05,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:05,145 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 08:13:05,145 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:05,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:05,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 [2018-12-09 08:13:05,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:05,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:05,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:05,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:05,155 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:13:05,155 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:05,179 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 08:13:05,203 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-09 08:13:05,203 INFO L444 ModelExtractionUtils]: 32 out of 37 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-09 08:13:05,204 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 08:13:05,206 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 08:13:05,206 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 08:13:05,207 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrlen_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_1) = -1*ULTIMATE.start_cstrlen_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_1 Supporting invariants [] [2018-12-09 08:13:05,247 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-12-09 08:13:05,252 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 08:13:05,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:13:05,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:13:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:13:05,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:13:05,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:13:05,321 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-09 08:13:05,322 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states. Second operand 4 states. [2018-12-09 08:13:05,393 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states.. Second operand 4 states. Result 80 states and 111 transitions. Complement of second has 7 states. [2018-12-09 08:13:05,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 08:13:05,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 08:13:05,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2018-12-09 08:13:05,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 77 transitions. Stem has 6 letters. Loop has 3 letters. [2018-12-09 08:13:05,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 08:13:05,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 77 transitions. Stem has 9 letters. Loop has 3 letters. [2018-12-09 08:13:05,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 08:13:05,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 77 transitions. Stem has 6 letters. Loop has 6 letters. [2018-12-09 08:13:05,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 08:13:05,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 111 transitions. [2018-12-09 08:13:05,402 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-09 08:13:05,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 27 states and 36 transitions. [2018-12-09 08:13:05,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-12-09 08:13:05,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-12-09 08:13:05,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2018-12-09 08:13:05,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 08:13:05,407 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2018-12-09 08:13:05,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2018-12-09 08:13:05,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-09 08:13:05,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-09 08:13:05,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2018-12-09 08:13:05,429 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2018-12-09 08:13:05,429 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2018-12-09 08:13:05,429 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 08:13:05,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2018-12-09 08:13:05,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-09 08:13:05,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 08:13:05,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 08:13:05,431 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:13:05,431 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:13:05,431 INFO L794 eck$LassoCheckResult]: Stem: 257#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 238#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 231#L588 assume !(main_~length1~0 < 1); 232#L588-2 assume !(main_~length2~0 < 1); 237#L591-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 248#L573 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 250#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 252#L551-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 253#L551-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 254#L553 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 256#L575-4 [2018-12-09 08:13:05,431 INFO L796 eck$LassoCheckResult]: Loop: 256#L575-4 goto; 239#L576-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 233#L577 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 234#L576 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 255#L575-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 246#L558 assume 0 == cstrncmp_~n % 4294967296;cstrncmp_#res := 0; 235#L566 cstrstr_#t~ret16 := cstrncmp_#res; 236#L575-2 assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; 256#L575-4 [2018-12-09 08:13:05,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:05,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1592231857, now seen corresponding path program 1 times [2018-12-09 08:13:05,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:13:05,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:13:05,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:05,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:13:05,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:05,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:05,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1752516368, now seen corresponding path program 1 times [2018-12-09 08:13:05,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:13:05,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:13:05,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:05,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:13:05,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:05,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:13:05,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:13:05,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:13:05,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 08:13:05,490 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 08:13:05,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 08:13:05,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 08:13:05,492 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-09 08:13:05,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:13:05,507 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2018-12-09 08:13:05,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 08:13:05,508 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2018-12-09 08:13:05,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-12-09 08:13:05,509 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 32 transitions. [2018-12-09 08:13:05,509 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-12-09 08:13:05,510 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-12-09 08:13:05,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2018-12-09 08:13:05,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 08:13:05,510 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-12-09 08:13:05,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2018-12-09 08:13:05,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-09 08:13:05,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-09 08:13:05,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2018-12-09 08:13:05,512 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-12-09 08:13:05,512 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-12-09 08:13:05,512 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 08:13:05,512 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2018-12-09 08:13:05,513 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-12-09 08:13:05,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 08:13:05,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 08:13:05,513 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:13:05,513 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:13:05,513 INFO L794 eck$LassoCheckResult]: Stem: 319#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 317#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 308#L588 assume !(main_~length1~0 < 1); 309#L588-2 assume !(main_~length2~0 < 1); 298#L591-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 299#L573 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 303#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 305#L551-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 306#L551-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 307#L553 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 318#L575-4 [2018-12-09 08:13:05,514 INFO L796 eck$LassoCheckResult]: Loop: 318#L575-4 goto; 316#L576-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 311#L577 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 312#L576 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 315#L575-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 300#L558 assume !(0 == cstrncmp_~n % 4294967296); 301#L560-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 310#L561 assume cstrncmp_#t~mem6 != cstrncmp_#t~mem7;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;call cstrncmp_#t~mem9 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;call cstrncmp_#t~mem10 := read~int(cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, 1);cstrncmp_#res := cstrncmp_#t~mem9 % 256 - cstrncmp_#t~mem10 % 256;havoc cstrncmp_#t~mem10;havoc cstrncmp_#t~mem9;havoc cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset; 313#L566 cstrstr_#t~ret16 := cstrncmp_#res; 314#L575-2 assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; 318#L575-4 [2018-12-09 08:13:05,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:05,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1592231857, now seen corresponding path program 2 times [2018-12-09 08:13:05,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:13:05,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:13:05,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:05,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:13:05,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:05,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:05,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:05,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:05,529 INFO L82 PathProgramCache]: Analyzing trace with hash 542190293, now seen corresponding path program 1 times [2018-12-09 08:13:05,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:13:05,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:13:05,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:05,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 08:13:05,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:05,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:05,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:05,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1106695813, now seen corresponding path program 1 times [2018-12-09 08:13:05,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:13:05,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:13:05,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:05,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:13:05,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:13:05,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:13:05,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:13:05,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 08:13:05,744 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 100 [2018-12-09 08:13:05,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 08:13:05,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 08:13:05,783 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-12-09 08:13:05,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:13:05,845 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2018-12-09 08:13:05,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 08:13:05,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 43 transitions. [2018-12-09 08:13:05,846 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-12-09 08:13:05,847 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 35 states and 41 transitions. [2018-12-09 08:13:05,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-12-09 08:13:05,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-12-09 08:13:05,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 41 transitions. [2018-12-09 08:13:05,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 08:13:05,847 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-12-09 08:13:05,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 41 transitions. [2018-12-09 08:13:05,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-12-09 08:13:05,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 08:13:05,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-12-09 08:13:05,849 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-12-09 08:13:05,849 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-12-09 08:13:05,849 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 08:13:05,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 39 transitions. [2018-12-09 08:13:05,850 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-12-09 08:13:05,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 08:13:05,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 08:13:05,851 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:13:05,851 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 08:13:05,851 INFO L794 eck$LassoCheckResult]: Stem: 401#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 397#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 389#L588 assume !(main_~length1~0 < 1); 390#L588-2 assume !(main_~length2~0 < 1); 378#L591-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 379#L573 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 383#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 385#L551-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 387#L551-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 388#L553 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 404#L575-4 goto; 396#L576-2 [2018-12-09 08:13:05,851 INFO L796 eck$LassoCheckResult]: Loop: 396#L576-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 392#L577 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 393#L576 assume !!(cstrstr_~sc~0 != cstrstr_~c~0); 396#L576-2 [2018-12-09 08:13:05,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:05,851 INFO L82 PathProgramCache]: Analyzing trace with hash 2114547350, now seen corresponding path program 1 times [2018-12-09 08:13:05,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:13:05,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:13:05,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:05,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:13:05,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:05,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:05,868 INFO L82 PathProgramCache]: Analyzing trace with hash 71663, now seen corresponding path program 1 times [2018-12-09 08:13:05,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:13:05,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:13:05,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:05,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:13:05,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:05,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:05,873 INFO L82 PathProgramCache]: Analyzing trace with hash 194815290, now seen corresponding path program 1 times [2018-12-09 08:13:05,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:13:05,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:13:05,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:05,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:13:05,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:05,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:06,200 WARN L180 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 127 [2018-12-09 08:13:06,452 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 106 [2018-12-09 08:13:06,453 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 08:13:06,454 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 08:13:06,454 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 08:13:06,454 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 08:13:06,454 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 08:13:06,454 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 08:13:06,454 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 08:13:06,454 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 08:13:06,454 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-termination.c.i_Iteration4_Lasso [2018-12-09 08:13:06,454 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 08:13:06,454 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 08:13:06,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:06,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:06,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:06,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:06,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:06,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:06,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:06,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:06,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:06,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:06,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:06,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:06,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:06,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:06,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:06,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:06,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:06,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:06,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:06,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:06,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:06,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:06,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:06,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:06,700 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2018-12-09 08:13:06,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:06,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:06,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:06,899 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2018-12-09 08:13:07,158 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 08:13:07,158 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 08:13:07,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 [2018-12-09 08:13:07,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:07,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:07,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:07,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:07,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:07,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:07,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:07,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:07,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 [2018-12-09 08:13:07,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:07,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:07,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:07,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:07,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:07,161 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:07,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:07,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:07,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 [2018-12-09 08:13:07,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:07,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:07,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:07,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:07,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:07,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:07,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:07,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:07,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:07,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:07,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:07,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:07,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:07,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:07,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:07,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:07,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:07,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 [2018-12-09 08:13:07,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:07,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:07,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:07,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:07,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:07,164 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:07,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:07,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:07,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 [2018-12-09 08:13:07,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:07,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:07,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:07,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:07,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:07,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:07,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:07,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:07,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:07,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:07,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:07,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:07,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:07,166 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:13:07,166 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:07,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:07,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 [2018-12-09 08:13:07,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:07,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:07,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:07,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:07,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:07,168 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:07,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:07,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:07,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:07,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:07,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:07,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:07,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:07,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:07,169 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:07,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:07,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:07,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 [2018-12-09 08:13:07,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:07,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:07,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:07,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:07,170 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:13:07,171 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:07,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:07,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 [2018-12-09 08:13:07,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:07,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:07,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:07,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:07,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:07,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:07,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:07,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:07,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 [2018-12-09 08:13:07,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:07,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:07,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:07,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:07,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:07,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:07,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:07,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:07,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 [2018-12-09 08:13:07,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:07,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:07,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:07,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:07,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:07,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:07,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:07,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:07,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:07,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:07,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:07,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:07,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:07,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:07,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:07,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:07,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:07,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 [2018-12-09 08:13:07,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:07,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:07,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:07,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:07,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:07,177 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:07,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:07,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:07,178 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:07,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:07,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:07,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:07,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:07,178 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:13:07,178 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:07,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:07,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 [2018-12-09 08:13:07,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:07,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:07,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:07,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:07,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:07,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:07,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:07,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:07,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:07,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:07,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:07,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:07,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:07,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:07,181 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:07,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:07,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:07,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:07,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:07,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:07,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:07,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:07,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:07,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:07,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:07,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:07,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 [2018-12-09 08:13:07,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:07,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:07,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:07,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:07,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:07,183 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:07,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:07,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:07,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 [2018-12-09 08:13:07,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:07,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:07,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:07,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:07,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:07,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:07,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:07,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:07,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:07,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:07,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:07,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:07,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:07,185 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:13:07,185 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:07,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:07,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:07,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:07,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:07,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:07,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:07,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:07,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:07,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:07,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:07,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 [2018-12-09 08:13:07,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:07,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:07,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:07,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:07,188 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:13:07,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:07,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:07,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:07,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:07,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:07,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:07,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:07,193 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:13:07,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:07,204 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 08:13:07,217 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 08:13:07,217 INFO L444 ModelExtractionUtils]: 53 out of 58 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-09 08:13:07,217 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 08:13:07,218 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 08:13:07,218 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 08:13:07,218 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrstr_~s.offset, v_rep(select #length ULTIMATE.start_cstrstr_~s.base)_1) = -1*ULTIMATE.start_cstrstr_~s.offset + 1*v_rep(select #length ULTIMATE.start_cstrstr_~s.base)_1 Supporting invariants [] [2018-12-09 08:13:07,276 INFO L297 tatePredicateManager]: 22 out of 22 supporting invariants were superfluous and have been removed [2018-12-09 08:13:07,277 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 08:13:07,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:13:07,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:13:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:13:07,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:13:07,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:13:07,312 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-09 08:13:07,312 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 39 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-12-09 08:13:07,325 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 39 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 50 states and 58 transitions. Complement of second has 4 states. [2018-12-09 08:13:07,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 08:13:07,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 08:13:07,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2018-12-09 08:13:07,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 11 letters. Loop has 3 letters. [2018-12-09 08:13:07,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 08:13:07,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-09 08:13:07,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 08:13:07,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 11 letters. Loop has 6 letters. [2018-12-09 08:13:07,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 08:13:07,326 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 58 transitions. [2018-12-09 08:13:07,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 08:13:07,327 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 36 states and 42 transitions. [2018-12-09 08:13:07,327 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-12-09 08:13:07,327 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-09 08:13:07,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 42 transitions. [2018-12-09 08:13:07,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 08:13:07,327 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-12-09 08:13:07,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 42 transitions. [2018-12-09 08:13:07,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-09 08:13:07,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-09 08:13:07,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-12-09 08:13:07,329 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-12-09 08:13:07,329 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-12-09 08:13:07,329 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 08:13:07,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 42 transitions. [2018-12-09 08:13:07,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 08:13:07,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 08:13:07,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 08:13:07,329 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:13:07,330 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 08:13:07,330 INFO L794 eck$LassoCheckResult]: Stem: 643#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 636#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 626#L588 assume !(main_~length1~0 < 1); 627#L588-2 assume !(main_~length2~0 < 1); 617#L591-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 618#L573 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 619#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 620#L551-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 609#L551-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 610#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 621#L551-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 622#L551-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 623#L553 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 637#L575-4 goto; 638#L576-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 628#L577 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 630#L576 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 633#L575-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 611#L558 assume !(0 == cstrncmp_~n % 4294967296); 612#L560-4 [2018-12-09 08:13:07,330 INFO L796 eck$LassoCheckResult]: Loop: 612#L560-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 624#L561 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post11.base, 1 + cstrncmp_#t~post11.offset;call cstrncmp_#t~mem12 := read~int(cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, 1); 639#L563 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~mem12;havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset; 640#L560-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 615#L560-2 assume !!(0 != cstrncmp_#t~pre4 % 4294967296);havoc cstrncmp_#t~pre4; 612#L560-4 [2018-12-09 08:13:07,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:07,330 INFO L82 PathProgramCache]: Analyzing trace with hash -912258627, now seen corresponding path program 1 times [2018-12-09 08:13:07,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:13:07,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:13:07,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:07,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:13:07,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:07,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:07,347 INFO L82 PathProgramCache]: Analyzing trace with hash 91772235, now seen corresponding path program 1 times [2018-12-09 08:13:07,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:13:07,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:13:07,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:07,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:13:07,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:07,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:07,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:07,354 INFO L82 PathProgramCache]: Analyzing trace with hash -599457521, now seen corresponding path program 1 times [2018-12-09 08:13:07,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:13:07,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:13:07,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:07,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:13:07,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:13:07,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:13:07,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:13:07,450 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1db597a1-95fa-4dcc-89bc-7751c8080b10/bin-2019/uautomizer/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 [2018-12-09 08:13:07,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:13:07,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:13:07,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:13:07,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:13:07,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 08:13:07,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-12-09 08:13:07,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 08:13:07,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-12-09 08:13:07,630 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. cyclomatic complexity: 9 Second operand 12 states. [2018-12-09 08:13:07,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:13:07,705 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-12-09 08:13:07,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 08:13:07,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 83 transitions. [2018-12-09 08:13:07,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 08:13:07,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 41 states and 47 transitions. [2018-12-09 08:13:07,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-09 08:13:07,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-09 08:13:07,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 47 transitions. [2018-12-09 08:13:07,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 08:13:07,707 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-12-09 08:13:07,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 47 transitions. [2018-12-09 08:13:07,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-12-09 08:13:07,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-09 08:13:07,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2018-12-09 08:13:07,708 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2018-12-09 08:13:07,708 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2018-12-09 08:13:07,708 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 08:13:07,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 45 transitions. [2018-12-09 08:13:07,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 08:13:07,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 08:13:07,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 08:13:07,709 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:13:07,709 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 08:13:07,709 INFO L794 eck$LassoCheckResult]: Stem: 842#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 839#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 829#L588 assume !(main_~length1~0 < 1); 830#L588-2 assume !(main_~length2~0 < 1); 818#L591-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 819#L573 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 822#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 823#L551-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 812#L551-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 813#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 824#L551-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 849#L551-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 850#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 848#L551-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 825#L551-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 826#L553 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 840#L575-4 goto; 841#L576-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 831#L577 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 833#L576 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 836#L575-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 814#L558 assume !(0 == cstrncmp_~n % 4294967296); 815#L560-4 [2018-12-09 08:13:07,709 INFO L796 eck$LassoCheckResult]: Loop: 815#L560-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 827#L561 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post11.base, 1 + cstrncmp_#t~post11.offset;call cstrncmp_#t~mem12 := read~int(cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, 1); 843#L563 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~mem12;havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset; 844#L560-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 820#L560-2 assume !!(0 != cstrncmp_#t~pre4 % 4294967296);havoc cstrncmp_#t~pre4; 815#L560-4 [2018-12-09 08:13:07,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:07,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1478230621, now seen corresponding path program 2 times [2018-12-09 08:13:07,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:13:07,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:13:07,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:07,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:13:07,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:07,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:07,725 INFO L82 PathProgramCache]: Analyzing trace with hash 91772235, now seen corresponding path program 2 times [2018-12-09 08:13:07,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:13:07,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:13:07,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:07,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 08:13:07,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:07,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:07,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1703636079, now seen corresponding path program 2 times [2018-12-09 08:13:07,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:13:07,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:13:07,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:07,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 08:13:07,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:08,373 WARN L180 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 185 [2018-12-09 08:13:08,829 WARN L180 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 141 [2018-12-09 08:13:08,831 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 08:13:08,831 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 08:13:08,831 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 08:13:08,831 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 08:13:08,831 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 08:13:08,831 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 08:13:08,832 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 08:13:08,832 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 08:13:08,832 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-termination.c.i_Iteration6_Lasso [2018-12-09 08:13:08,832 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 08:13:08,832 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 08:13:08,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:08,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:08,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:08,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:08,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:08,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:08,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:08,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:08,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:08,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:08,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:08,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:08,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:08,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:08,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:08,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:08,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:08,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:08,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:08,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:09,538 WARN L180 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 132 [2018-12-09 08:13:09,672 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2018-12-09 08:13:09,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:09,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:09,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:09,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:09,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:09,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:09,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:09,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:09,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:09,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:09,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:09,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:09,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:09,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:09,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:09,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:09,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:09,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:09,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:09,977 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2018-12-09 08:13:10,403 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 08:13:10,403 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 08:13:10,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 [2018-12-09 08:13:10,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:10,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:10,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:10,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:10,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:10,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:10,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:10,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:10,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 [2018-12-09 08:13:10,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:10,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:10,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:10,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:10,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:10,406 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:10,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:10,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:10,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:10,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:10,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:10,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:10,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:10,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:10,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:10,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:10,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:10,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 [2018-12-09 08:13:10,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:10,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:10,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:10,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:10,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:10,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:10,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:10,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:10,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:10,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:10,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:10,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:10,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:10,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:10,410 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:10,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:10,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:10,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 [2018-12-09 08:13:10,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:10,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:10,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:10,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:10,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:10,411 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:10,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:10,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:10,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 [2018-12-09 08:13:10,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:10,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:10,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:10,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:10,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:10,411 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:10,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:10,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:10,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:10,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:10,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:10,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:10,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:10,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:10,412 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:10,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:10,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:10,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:10,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:10,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:10,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:10,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:10,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:10,413 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:10,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:10,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:10,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:10,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:10,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:10,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:10,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:10,414 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:13:10,414 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:10,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:10,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:10,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:10,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:10,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:10,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:10,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:10,416 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:10,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:10,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:10,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:10,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:10,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:10,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:10,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:10,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:10,417 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:10,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:10,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:10,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:10,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:10,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:10,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:10,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:10,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:10,418 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:10,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:10,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:10,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:10,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:10,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:10,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:10,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:10,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:10,420 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:10,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:10,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:10,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:10,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:10,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:10,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:10,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:10,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:10,421 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:10,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:10,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:10,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:10,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:10,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:10,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:10,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:10,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:10,423 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:10,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:10,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:10,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 [2018-12-09 08:13:10,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:10,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:10,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:10,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:10,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:10,424 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:10,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:10,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:10,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 [2018-12-09 08:13:10,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:10,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:10,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:10,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:10,426 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:13:10,426 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:10,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:10,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:10,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:10,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:10,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:10,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:10,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:10,428 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:10,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:10,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:10,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:10,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:10,430 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 08:13:10,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:10,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:10,431 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 08:13:10,431 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:10,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:10,437 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:10,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:10,438 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 08:13:10,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:10,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:10,438 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 08:13:10,438 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:10,440 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:10,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 [2018-12-09 08:13:10,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:10,441 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 08:13:10,441 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 08:13:10,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:10,443 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-09 08:13:10,443 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-09 08:13:10,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:10,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 [2018-12-09 08:13:10,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:10,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:10,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:10,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:10,452 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:13:10,452 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:10,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:10,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 [2018-12-09 08:13:10,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:10,456 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 08:13:10,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:10,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:10,458 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 08:13:10,458 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:10,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:10,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:10,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:10,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:10,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:10,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:10,466 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:13:10,466 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:10,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:10,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 [2018-12-09 08:13:10,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:10,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:10,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:10,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:10,468 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:13:10,468 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:10,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:10,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:10,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:10,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:10,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:10,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:10,470 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:13:10,470 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:10,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:10,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:10,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:10,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:10,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:10,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:10,477 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:13:10,477 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:10,537 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 08:13:10,555 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 08:13:10,555 INFO L444 ModelExtractionUtils]: 79 out of 85 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-09 08:13:10,555 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 08:13:10,555 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 08:13:10,556 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 08:13:10,556 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrncmp_~s2.base)_1, ULTIMATE.start_cstrncmp_~s1.offset) = 1*v_rep(select #length ULTIMATE.start_cstrncmp_~s2.base)_1 - 1*ULTIMATE.start_cstrncmp_~s1.offset Supporting invariants [] [2018-12-09 08:13:10,705 INFO L297 tatePredicateManager]: 50 out of 51 supporting invariants were superfluous and have been removed [2018-12-09 08:13:10,706 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 08:13:10,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:13:10,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:13:10,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:13:10,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:13:10,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:13:10,785 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2018-12-09 08:13:10,786 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 45 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-12-09 08:13:10,848 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 45 transitions. cyclomatic complexity: 9. Second operand 7 states. Result 97 states and 112 transitions. Complement of second has 11 states. [2018-12-09 08:13:10,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2018-12-09 08:13:10,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 08:13:10,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2018-12-09 08:13:10,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 22 letters. Loop has 5 letters. [2018-12-09 08:13:10,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 08:13:10,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 27 letters. Loop has 5 letters. [2018-12-09 08:13:10,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 08:13:10,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 22 letters. Loop has 10 letters. [2018-12-09 08:13:10,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 08:13:10,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 112 transitions. [2018-12-09 08:13:10,852 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 08:13:10,852 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 74 states and 87 transitions. [2018-12-09 08:13:10,852 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-12-09 08:13:10,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-12-09 08:13:10,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 87 transitions. [2018-12-09 08:13:10,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 08:13:10,853 INFO L705 BuchiCegarLoop]: Abstraction has 74 states and 87 transitions. [2018-12-09 08:13:10,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 87 transitions. [2018-12-09 08:13:10,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 53. [2018-12-09 08:13:10,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-09 08:13:10,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2018-12-09 08:13:10,856 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2018-12-09 08:13:10,856 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2018-12-09 08:13:10,856 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 08:13:10,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 62 transitions. [2018-12-09 08:13:10,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 08:13:10,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 08:13:10,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 08:13:10,857 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:13:10,857 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 08:13:10,857 INFO L794 eck$LassoCheckResult]: Stem: 1310#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1306#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 1294#L588 assume !(main_~length1~0 < 1); 1295#L588-2 assume !(main_~length2~0 < 1); 1280#L591-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 1281#L573 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 1289#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1290#L551-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1278#L551-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 1279#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1291#L551-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1319#L551-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 1318#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1317#L551-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1292#L551-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 1293#L553 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 1307#L575-4 goto; 1308#L576-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 1309#L577 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 1330#L576 assume !!(cstrstr_~sc~0 != cstrstr_~c~0); 1305#L576-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 1298#L577 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 1300#L576 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 1303#L575-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 1282#L558 assume !(0 == cstrncmp_~n % 4294967296); 1283#L560-4 [2018-12-09 08:13:10,857 INFO L796 eck$LassoCheckResult]: Loop: 1283#L560-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 1296#L561 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post11.base, 1 + cstrncmp_#t~post11.offset;call cstrncmp_#t~mem12 := read~int(cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, 1); 1311#L563 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~mem12;havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset; 1312#L560-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 1286#L560-2 assume !!(0 != cstrncmp_#t~pre4 % 4294967296);havoc cstrncmp_#t~pre4; 1283#L560-4 [2018-12-09 08:13:10,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:10,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1711753785, now seen corresponding path program 1 times [2018-12-09 08:13:10,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:13:10,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:13:10,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:10,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 08:13:10,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:10,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:10,877 INFO L82 PathProgramCache]: Analyzing trace with hash 91772235, now seen corresponding path program 3 times [2018-12-09 08:13:10,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:13:10,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:13:10,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:10,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:13:10,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:10,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:10,884 INFO L82 PathProgramCache]: Analyzing trace with hash -234967533, now seen corresponding path program 1 times [2018-12-09 08:13:10,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:13:10,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:13:10,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:10,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 08:13:10,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:11,664 WARN L180 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 251 DAG size of output: 207 [2018-12-09 08:13:12,155 WARN L180 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 152 [2018-12-09 08:13:12,157 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 08:13:12,157 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 08:13:12,157 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 08:13:12,157 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 08:13:12,157 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 08:13:12,157 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 08:13:12,157 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 08:13:12,157 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 08:13:12,157 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-termination.c.i_Iteration7_Lasso [2018-12-09 08:13:12,157 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 08:13:12,158 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 08:13:12,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:12,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:12,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:12,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:12,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:12,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:12,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:12,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:12,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:12,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:12,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:12,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:12,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:12,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:12,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:12,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:12,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:12,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:12,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:12,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:12,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:12,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:12,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:12,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:12,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:12,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:12,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:12,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:12,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:12,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:12,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:12,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:12,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:12,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:12,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:13,030 WARN L180 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 138 [2018-12-09 08:13:13,238 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2018-12-09 08:13:13,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:13,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:13,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:13,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:13,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:13,526 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 89 [2018-12-09 08:13:13,674 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2018-12-09 08:13:13,932 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-12-09 08:13:14,118 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 08:13:14,118 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 08:13:14,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 [2018-12-09 08:13:14,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:14,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:14,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:14,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:14,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:14,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,121 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:14,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:14,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,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 [2018-12-09 08:13:14,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:14,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,122 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:14,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:14,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:14,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:14,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:14,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:14,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:14,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:14,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:14,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:14,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:14,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,126 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:13:14,127 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:14,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:14,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:14,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:14,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:14,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:14,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:14,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,130 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:14,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:14,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,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 [2018-12-09 08:13:14,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:14,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:14,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:14,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,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 [2018-12-09 08:13:14,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:14,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,132 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:14,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:14,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:14,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:14,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:14,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:14,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:14,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:14,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,134 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:14,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:14,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:14,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:14,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:14,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:14,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,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 [2018-12-09 08:13:14,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:14,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,137 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:14,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:14,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:14,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,138 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:13:14,138 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:14,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:14,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:14,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:14,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:14,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:14,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:14,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:14,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:14,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:14,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:14,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:14,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:14,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,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 [2018-12-09 08:13:14,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:14,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,144 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:14,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:14,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,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 [2018-12-09 08:13:14,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:14,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:14,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:14,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:14,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:14,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:14,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:14,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,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 [2018-12-09 08:13:14,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:14,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:14,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:14,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:14,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:14,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:14,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:14,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,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 [2018-12-09 08:13:14,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:14,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,151 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:14,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:14,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,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 [2018-12-09 08:13:14,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:14,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,153 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:14,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:14,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:14,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:14,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,154 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:14,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:14,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,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 [2018-12-09 08:13:14,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:13:14,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:14,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:14,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,158 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:13:14,158 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:14,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,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 [2018-12-09 08:13:14,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:14,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:14,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:14,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,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 [2018-12-09 08:13:14,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:14,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,161 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:14,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:14,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:14,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,163 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:13:14,163 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:14,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,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 [2018-12-09 08:13:14,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:14,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:14,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:14,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:14,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:14,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:14,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:14,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,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 [2018-12-09 08:13:14,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:14,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,168 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:14,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:14,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:14,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,169 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 08:13:14,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,170 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 08:13:14,170 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:14,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:14,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,172 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:13:14,172 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:14,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:14,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,176 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:13:14,176 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:14,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,178 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:14,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,179 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:13:14,179 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:14,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,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 [2018-12-09 08:13:14,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,182 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 08:13:14,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,184 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 08:13:14,184 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:14,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:14,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,192 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:13:14,192 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:14,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:14,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,193 INFO L205 nArgumentSynthesizer]: 6 stem disjuncts [2018-12-09 08:13:14,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,195 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-12-09 08:13:14,195 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:14,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:14,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:14,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:14,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:14,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:14,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:14,205 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:13:14,205 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:14,230 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 08:13:14,283 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 08:13:14,283 INFO L444 ModelExtractionUtils]: 78 out of 85 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-09 08:13:14,283 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 08:13:14,284 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 08:13:14,284 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 08:13:14,284 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrstr_#in~s.base)_2, ULTIMATE.start_cstrncmp_~s1.offset) = 1*v_rep(select #length ULTIMATE.start_cstrstr_#in~s.base)_2 - 1*ULTIMATE.start_cstrncmp_~s1.offset Supporting invariants [] [2018-12-09 08:13:14,569 INFO L297 tatePredicateManager]: 74 out of 76 supporting invariants were superfluous and have been removed [2018-12-09 08:13:14,572 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 08:13:14,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:13:14,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:13:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:13:14,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:13:14,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:13:14,647 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-12-09 08:13:14,647 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 62 transitions. cyclomatic complexity: 13 Second operand 6 states. [2018-12-09 08:13:14,683 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 62 transitions. cyclomatic complexity: 13. Second operand 6 states. Result 108 states and 127 transitions. Complement of second has 9 states. [2018-12-09 08:13:14,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 08:13:14,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-09 08:13:14,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2018-12-09 08:13:14,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 25 letters. Loop has 5 letters. [2018-12-09 08:13:14,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 08:13:14,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 30 letters. Loop has 5 letters. [2018-12-09 08:13:14,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 08:13:14,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 25 letters. Loop has 10 letters. [2018-12-09 08:13:14,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 08:13:14,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 127 transitions. [2018-12-09 08:13:14,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 08:13:14,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 77 states and 91 transitions. [2018-12-09 08:13:14,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-12-09 08:13:14,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-12-09 08:13:14,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 91 transitions. [2018-12-09 08:13:14,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 08:13:14,688 INFO L705 BuchiCegarLoop]: Abstraction has 77 states and 91 transitions. [2018-12-09 08:13:14,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 91 transitions. [2018-12-09 08:13:14,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 54. [2018-12-09 08:13:14,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-09 08:13:14,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2018-12-09 08:13:14,691 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-12-09 08:13:14,691 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-12-09 08:13:14,691 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-09 08:13:14,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 63 transitions. [2018-12-09 08:13:14,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 08:13:14,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 08:13:14,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 08:13:14,693 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:13:14,693 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 08:13:14,693 INFO L794 eck$LassoCheckResult]: Stem: 1907#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1899#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 1888#L588 assume !(main_~length1~0 < 1); 1889#L588-2 assume !(main_~length2~0 < 1); 1878#L591-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 1879#L573 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 1880#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1881#L551-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1869#L551-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 1870#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1882#L551-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1912#L551-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 1915#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1911#L551-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1883#L551-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 1884#L553 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 1900#L575-4 goto; 1901#L576-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 1890#L577 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 1891#L576 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 1917#L575-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 1919#L558 assume !(0 == cstrncmp_~n % 4294967296); 1918#L560-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 1887#L561 assume cstrncmp_#t~mem6 != cstrncmp_#t~mem7;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;call cstrncmp_#t~mem9 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;call cstrncmp_#t~mem10 := read~int(cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, 1);cstrncmp_#res := cstrncmp_#t~mem9 % 256 - cstrncmp_#t~mem10 % 256;havoc cstrncmp_#t~mem10;havoc cstrncmp_#t~mem9;havoc cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset; 1892#L566 cstrstr_#t~ret16 := cstrncmp_#res; 1893#L575-2 assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; 1908#L575-4 goto; 1898#L576-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 1916#L577 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 1894#L576 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 1895#L575-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 1871#L558 assume !(0 == cstrncmp_~n % 4294967296); 1872#L560-4 [2018-12-09 08:13:14,693 INFO L796 eck$LassoCheckResult]: Loop: 1872#L560-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 1885#L561 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post11.base, 1 + cstrncmp_#t~post11.offset;call cstrncmp_#t~mem12 := read~int(cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, 1); 1903#L563 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~mem12;havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset; 1904#L560-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 1875#L560-2 assume !!(0 != cstrncmp_#t~pre4 % 4294967296);havoc cstrncmp_#t~pre4; 1872#L560-4 [2018-12-09 08:13:14,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:14,693 INFO L82 PathProgramCache]: Analyzing trace with hash -2051218895, now seen corresponding path program 1 times [2018-12-09 08:13:14,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:13:14,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:13:14,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:14,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:13:14,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:14,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:14,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:14,716 INFO L82 PathProgramCache]: Analyzing trace with hash 91772235, now seen corresponding path program 4 times [2018-12-09 08:13:14,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:13:14,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:13:14,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:14,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:13:14,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:14,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:14,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:14,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1369353957, now seen corresponding path program 1 times [2018-12-09 08:13:14,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:13:14,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:13:14,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:14,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 08:13:14,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:13:15,857 WARN L180 SmtUtils]: Spent 976.00 ms on a formula simplification. DAG size of input: 325 DAG size of output: 256 [2018-12-09 08:13:16,432 WARN L180 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 153 [2018-12-09 08:13:16,434 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 08:13:16,434 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 08:13:16,434 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 08:13:16,434 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 08:13:16,434 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 08:13:16,434 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 08:13:16,434 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 08:13:16,434 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 08:13:16,434 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-termination.c.i_Iteration8_Lasso [2018-12-09 08:13:16,434 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 08:13:16,434 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 08:13:16,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:16,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:16,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:16,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:16,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:16,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:16,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:16,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:16,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:16,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:16,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:17,606 WARN L180 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 143 [2018-12-09 08:13:18,108 WARN L180 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 93 [2018-12-09 08:13:18,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:18,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:18,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:18,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:18,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:18,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:18,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:18,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:18,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:18,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:18,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:18,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:18,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:18,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:18,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:18,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:18,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:18,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:18,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:18,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:18,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:18,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:18,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:18,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:18,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:18,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:18,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:18,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:18,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:13:18,467 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2018-12-09 08:13:18,649 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2018-12-09 08:13:19,298 WARN L180 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2018-12-09 08:13:19,544 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-12-09 08:13:19,646 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-12-09 08:13:19,857 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-12-09 08:13:19,933 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 08:13:19,933 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 08:13:19,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 [2018-12-09 08:13:19,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:19,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:19,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:19,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:19,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:19,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:19,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:19,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:19,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 [2018-12-09 08:13:19,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:19,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:19,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:19,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:19,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:19,936 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:19,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:19,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:19,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 [2018-12-09 08:13:19,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:19,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:19,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:19,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:19,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:19,938 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:19,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:19,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:19,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 [2018-12-09 08:13:19,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:19,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:19,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:19,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:19,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:19,940 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:19,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:19,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:19,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:19,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:19,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:19,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:19,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:19,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:19,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:19,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:19,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:19,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 [2018-12-09 08:13:19,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:19,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:19,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:19,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:19,945 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:13:19,945 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:19,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:19,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:19,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:19,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:19,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:19,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:19,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:19,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:19,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:19,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:19,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:19,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:19,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:19,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:19,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:19,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:19,950 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:19,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:19,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:19,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:19,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:19,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:19,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:19,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:19,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:19,952 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:19,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:19,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:19,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:19,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:19,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:13:19,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:19,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:19,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:19,954 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:13:19,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:13:19,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:19,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:19,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:19,956 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-12-09 08:13:19,956 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 08:13:19,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:19,962 INFO L402 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2018-12-09 08:13:19,962 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-09 08:13:19,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:19,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 [2018-12-09 08:13:19,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:19,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:19,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:19,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:19,988 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:13:19,988 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:19,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:13:19,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:13:19,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:13:19,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:13:19,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:13:19,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:13:19,995 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:13:19,995 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:13:20,030 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 08:13:20,061 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 08:13:20,061 INFO L444 ModelExtractionUtils]: 78 out of 85 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-09 08:13:20,062 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 08:13:20,062 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 08:13:20,062 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 08:13:20,062 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrncmp_~s1.base)_3, ULTIMATE.start_cstrncmp_~s1.offset) = 1*v_rep(select #length ULTIMATE.start_cstrncmp_~s1.base)_3 - 1*ULTIMATE.start_cstrncmp_~s1.offset Supporting invariants [] [2018-12-09 08:13:20,341 INFO L297 tatePredicateManager]: 84 out of 84 supporting invariants were superfluous and have been removed [2018-12-09 08:13:20,342 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 08:13:20,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:13:20,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:13:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:13:20,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:13:20,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:13:20,395 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-09 08:13:20,395 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand 4 states. [2018-12-09 08:13:20,407 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 80 states and 94 transitions. Complement of second has 7 states. [2018-12-09 08:13:20,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 08:13:20,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 08:13:20,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2018-12-09 08:13:20,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 32 letters. Loop has 5 letters. [2018-12-09 08:13:20,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 08:13:20,408 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 08:13:20,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:13:20,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:13:20,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:13:20,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:13:20,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:13:20,460 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-09 08:13:20,460 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand 4 states. [2018-12-09 08:13:20,478 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 79 states and 93 transitions. Complement of second has 7 states. [2018-12-09 08:13:20,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 08:13:20,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 08:13:20,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2018-12-09 08:13:20,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 32 letters. Loop has 5 letters. [2018-12-09 08:13:20,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 08:13:20,479 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 08:13:20,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:13:20,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:13:20,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:13:20,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:13:20,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:13:20,532 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-09 08:13:20,532 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand 4 states. [2018-12-09 08:13:20,543 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 82 states and 96 transitions. Complement of second has 6 states. [2018-12-09 08:13:20,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 08:13:20,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 08:13:20,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2018-12-09 08:13:20,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 32 letters. Loop has 5 letters. [2018-12-09 08:13:20,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 08:13:20,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 37 letters. Loop has 5 letters. [2018-12-09 08:13:20,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 08:13:20,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 32 letters. Loop has 10 letters. [2018-12-09 08:13:20,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 08:13:20,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 96 transitions. [2018-12-09 08:13:20,546 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 08:13:20,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 0 states and 0 transitions. [2018-12-09 08:13:20,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 08:13:20,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 08:13:20,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 08:13:20,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 08:13:20,546 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 08:13:20,546 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 08:13:20,546 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 08:13:20,546 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-09 08:13:20,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 08:13:20,547 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 08:13:20,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 08:13:20,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 08:13:20 BoogieIcfgContainer [2018-12-09 08:13:20,551 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 08:13:20,551 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 08:13:20,551 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 08:13:20,551 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 08:13:20,552 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:13:03" (3/4) ... [2018-12-09 08:13:20,554 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 08:13:20,554 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 08:13:20,555 INFO L168 Benchmark]: Toolchain (without parser) took 17284.15 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 385.4 MB). Free memory was 950.6 MB in the beginning and 1.0 GB in the end (delta: -70.3 MB). Peak memory consumption was 315.1 MB. Max. memory is 11.5 GB. [2018-12-09 08:13:20,556 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 08:13:20,556 INFO L168 Benchmark]: CACSL2BoogieTranslator took 269.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -142.0 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-09 08:13:20,556 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 08:13:20,557 INFO L168 Benchmark]: Boogie Preprocessor took 18.03 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 08:13:20,557 INFO L168 Benchmark]: RCFGBuilder took 205.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-12-09 08:13:20,557 INFO L168 Benchmark]: BuchiAutomizer took 16757.71 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 282.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 41.3 MB). Peak memory consumption was 323.4 MB. Max. memory is 11.5 GB. [2018-12-09 08:13:20,558 INFO L168 Benchmark]: Witness Printer took 3.14 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 08:13:20,560 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 269.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -142.0 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.03 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 205.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16757.71 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 282.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 41.3 MB). Peak memory consumption was 323.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.14 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] and consists of 5 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[s2] + -1 * s1 and consists of 8 locations. One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s1 and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[s1] + -1 * s1 and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.7s and 9 iterations. TraceHistogramMax:3. Analysis of lassos took 15.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 48 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 54 states and ocurred in iteration 7. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 300 SDtfs, 321 SDslu, 488 SDs, 0 SdLazy, 205 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital306 mio100 ax106 hnf99 lsp91 ukn90 mio100 lsp48 div141 bol100 ite100 ukn100 eq170 hnf75 smp95 dnf127 smp89 tf100 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 12 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 28 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...