./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/cstrspn_malloc_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-15/cstrspn_malloc_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 9c357a0f089ccce134e4135f49c3923f49db9d7a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:47:31,605 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:47:31,607 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:47:31,618 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:47:31,619 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:47:31,620 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:47:31,621 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:47:31,623 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:47:31,625 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:47:31,626 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:47:31,627 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:47:31,627 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:47:31,628 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:47:31,630 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:47:31,631 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:47:31,632 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:47:31,633 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:47:31,635 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:47:31,637 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:47:31,639 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:47:31,640 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:47:31,641 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:47:31,644 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:47:31,644 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:47:31,645 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:47:31,646 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:47:31,650 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:47:31,650 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:47:31,651 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:47:31,652 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:47:31,653 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:47:31,653 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:47:31,654 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:47:31,657 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:47:31,658 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:47:31,658 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:47:31,659 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:47:31,693 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:47:31,694 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:47:31,695 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:47:31,695 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:47:31,695 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:47:31,699 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:47:31,700 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:47:31,700 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:47:31,700 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:47:31,700 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:47:31,700 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:47:31,701 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:47:31,702 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:47:31,702 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:47:31,702 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:47:31,702 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:47:31,702 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:47:31,703 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:47:31,703 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:47:31,703 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:47:31,703 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:47:31,703 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:47:31,704 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:47:31,706 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:47:31,706 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:47:31,707 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:47:31,707 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:47:31,707 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:47:31,708 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:47:31,708 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 9c357a0f089ccce134e4135f49c3923f49db9d7a [2019-01-14 02:47:31,765 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:47:31,781 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:47:31,787 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:47:31,789 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:47:31,790 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:47:31,791 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/cstrspn_malloc_true-termination.c.i [2019-01-14 02:47:31,851 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8304d786/56605f273a394025bc12a525b3094089/FLAG2f4af91bd [2019-01-14 02:47:32,367 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:47:32,368 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/cstrspn_malloc_true-termination.c.i [2019-01-14 02:47:32,380 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8304d786/56605f273a394025bc12a525b3094089/FLAG2f4af91bd [2019-01-14 02:47:32,601 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8304d786/56605f273a394025bc12a525b3094089 [2019-01-14 02:47:32,604 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:47:32,605 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:47:32,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:47:32,606 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:47:32,610 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:47:32,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:47:32" (1/1) ... [2019-01-14 02:47:32,613 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27805ee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:32, skipping insertion in model container [2019-01-14 02:47:32,613 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:47:32" (1/1) ... [2019-01-14 02:47:32,621 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:47:32,660 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:47:33,051 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:47:33,067 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:47:33,205 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:47:33,270 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:47:33,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:33 WrapperNode [2019-01-14 02:47:33,270 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:47:33,271 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:47:33,271 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:47:33,271 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:47:33,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:33" (1/1) ... [2019-01-14 02:47:33,301 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:33" (1/1) ... [2019-01-14 02:47:33,329 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:47:33,329 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:47:33,329 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:47:33,329 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:47:33,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:33" (1/1) ... [2019-01-14 02:47:33,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:33" (1/1) ... [2019-01-14 02:47:33,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:33" (1/1) ... [2019-01-14 02:47:33,341 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:33" (1/1) ... [2019-01-14 02:47:33,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:33" (1/1) ... [2019-01-14 02:47:33,355 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:33" (1/1) ... [2019-01-14 02:47:33,357 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:33" (1/1) ... [2019-01-14 02:47:33,359 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:47:33,360 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:47:33,360 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:47:33,360 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:47:33,361 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:47:33,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:47:33,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:47:33,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 02:47:33,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:47:33,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:47:33,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:47:33,876 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:47:33,877 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 02:47:33,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:47:33 BoogieIcfgContainer [2019-01-14 02:47:33,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:47:33,879 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:47:33,879 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:47:33,883 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:47:33,884 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:47:33,884 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:47:32" (1/3) ... [2019-01-14 02:47:33,885 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@279649ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:47:33, skipping insertion in model container [2019-01-14 02:47:33,885 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:47:33,885 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:33" (2/3) ... [2019-01-14 02:47:33,885 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@279649ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:47:33, skipping insertion in model container [2019-01-14 02:47:33,886 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:47:33,886 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:47:33" (3/3) ... [2019-01-14 02:47:33,887 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrspn_malloc_true-termination.c.i [2019-01-14 02:47:33,942 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:47:33,943 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:47:33,943 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:47:33,943 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:47:33,943 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:47:33,943 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:47:33,943 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:47:33,944 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:47:33,944 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:47:33,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-14 02:47:33,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:47:33,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:47:33,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:47:33,983 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:47:33,984 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:47:33,984 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:47:33,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-14 02:47:33,986 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:47:33,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:47:33,986 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:47:33,987 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:47:33,987 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:47:33,995 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 12#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 10#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.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);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 6#L369-4true [2019-01-14 02:47:33,995 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 18#L369-1true assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 8#L374true assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 5#L369-3true cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 6#L369-4true [2019-01-14 02:47:34,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:34,003 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-01-14 02:47:34,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:34,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:34,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:34,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:34,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:34,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:34,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2019-01-14 02:47:34,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:34,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:34,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:34,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:34,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:47:34,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:47:34,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:47:34,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:47:34,199 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:47:34,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 02:47:34,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 02:47:34,218 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-01-14 02:47:34,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:47:34,225 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-01-14 02:47:34,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 02:47:34,228 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-01-14 02:47:34,229 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:47:34,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2019-01-14 02:47:34,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-14 02:47:34,235 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-14 02:47:34,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-01-14 02:47:34,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:47:34,236 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-14 02:47:34,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-01-14 02:47:34,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-14 02:47:34,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 02:47:34,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-01-14 02:47:34,265 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-14 02:47:34,265 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-14 02:47:34,265 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:47:34,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-01-14 02:47:34,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:47:34,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:47:34,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:47:34,267 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:47:34,267 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:47:34,267 INFO L794 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 50#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 51#L382 assume !(main_~length1~0 < 1); 52#L382-2 assume !(main_~length2~0 < 1); 49#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.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);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 47#L369-4 [2019-01-14 02:47:34,268 INFO L796 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 48#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 56#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 53#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 54#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209; 44#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 45#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 46#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 47#L369-4 [2019-01-14 02:47:34,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:34,268 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-01-14 02:47:34,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:34,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:34,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:34,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:34,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:34,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:34,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2019-01-14 02:47:34,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:34,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:34,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:34,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:47:34,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:34,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:34,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:34,368 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2019-01-14 02:47:34,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:34,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:34,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:34,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:34,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:34,955 WARN L181 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-01-14 02:47:35,784 WARN L181 SmtUtils]: Spent 801.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-01-14 02:47:36,117 WARN L181 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-01-14 02:47:36,277 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-14 02:47:36,289 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:47:36,290 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:47:36,291 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:47:36,291 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:47:36,291 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:47:36,291 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:47:36,291 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:47:36,291 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:47:36,292 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_malloc_true-termination.c.i_Iteration2_Lasso [2019-01-14 02:47:36,292 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:47:36,292 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:47:36,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:36,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:36,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:36,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:36,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:36,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:36,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:36,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:36,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:36,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:36,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:36,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:36,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:36,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:36,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:36,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:36,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:36,856 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-01-14 02:47:37,154 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-01-14 02:47:37,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:37,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:37,969 WARN L181 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-14 02:47:38,118 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-14 02:47:38,409 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2019-01-14 02:47:38,451 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:47:38,457 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:47:38,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:38,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:38,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:38,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:38,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:38,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:38,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:38,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:38,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:38,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 [2019-01-14 02:47:38,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:38,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:38,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:38,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:38,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:38,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:38,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:38,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:38,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:38,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:38,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:38,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:38,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:38,479 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:38,479 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:38,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:38,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:38,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:38,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:38,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:38,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:38,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:38,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:38,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:38,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:38,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:38,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:38,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:38,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:38,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:38,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:38,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:38,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:38,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:38,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:38,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:38,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:38,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:38,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:38,495 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:38,497 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:38,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:38,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:38,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:38,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:38,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:38,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:38,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:38,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:38,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:38,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:38,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:38,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:38,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:38,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:38,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:38,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:38,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:38,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:38,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:38,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:38,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:38,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:38,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:38,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:38,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:38,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:38,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:38,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:38,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:38,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:38,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:38,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:38,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:38,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:38,537 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:38,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:38,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:38,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:38,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:38,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:38,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:38,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:38,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:38,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:38,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:38,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:38,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:38,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:38,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:38,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:38,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:38,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:38,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:38,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:38,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:38,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:38,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:38,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:38,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:38,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:38,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:38,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:38,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:38,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:38,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:38,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:38,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:38,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:38,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:38,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:38,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:38,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:38,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:38,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:38,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:38,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:38,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:38,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:38,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:38,581 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:38,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:38,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:38,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:38,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:38,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:38,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:38,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:38,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:38,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:38,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:38,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:38,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:38,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:38,594 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 02:47:38,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:38,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:38,616 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:47:38,617 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:38,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:38,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:38,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:38,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:38,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:38,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:38,698 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:38,698 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:38,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:38,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:38,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:38,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:38,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:38,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:38,707 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:38,707 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:38,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:38,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:38,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:38,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:38,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:38,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:38,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:38,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:38,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:38,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:38,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:38,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:38,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:38,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:38,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:38,742 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:38,742 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:38,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:38,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:38,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:38,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:38,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:38,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:38,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:38,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:38,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:38,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:38,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:38,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:38,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:38,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:38,757 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:38,757 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:38,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:38,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:38,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:38,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:38,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:38,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:38,773 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:38,774 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:38,821 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:47:38,849 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:47:38,849 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-14 02:47:38,852 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:47:38,853 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:47:38,854 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:47:38,854 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~sc1~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1) = -1*ULTIMATE.start_cstrspn_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1 Supporting invariants [] [2019-01-14 02:47:39,038 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2019-01-14 02:47:39,049 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:47:39,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:47:39,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:47:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:47:39,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:47:39,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:47:39,154 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 [2019-01-14 02:47:39,155 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-14 02:47:39,248 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2019-01-14 02:47:39,250 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 [2019-01-14 02:47:39,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:47:39,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-01-14 02:47:39,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2019-01-14 02:47:39,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:39,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2019-01-14 02:47:39,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:39,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2019-01-14 02:47:39,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:39,256 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-01-14 02:47:39,257 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:47:39,258 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2019-01-14 02:47:39,258 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-14 02:47:39,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 02:47:39,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-01-14 02:47:39,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:47:39,259 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-14 02:47:39,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-01-14 02:47:39,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-14 02:47:39,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-14 02:47:39,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-01-14 02:47:39,262 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-14 02:47:39,262 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-14 02:47:39,262 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:47:39,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-01-14 02:47:39,263 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:47:39,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:47:39,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:47:39,263 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:47:39,263 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:47:39,264 INFO L794 eck$LassoCheckResult]: Stem: 193#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 186#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 187#L382 assume !(main_~length1~0 < 1); 188#L382-2 assume !(main_~length2~0 < 1); 185#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.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);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 182#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 184#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 194#L372-5 [2019-01-14 02:47:39,264 INFO L796 eck$LassoCheckResult]: Loop: 194#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 189#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 190#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, 1 + cstrspn_#t~post211.offset;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 194#L372-5 [2019-01-14 02:47:39,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:39,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2019-01-14 02:47:39,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:39,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:39,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:39,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:39,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:39,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:39,315 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2019-01-14 02:47:39,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:39,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:39,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:39,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:39,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:39,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:39,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2019-01-14 02:47:39,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:39,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:39,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:39,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:39,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:39,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:39,523 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-01-14 02:47:39,661 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-14 02:47:39,999 WARN L181 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 103 [2019-01-14 02:47:40,159 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-01-14 02:47:40,163 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:47:40,164 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:47:40,164 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:47:40,164 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:47:40,164 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:47:40,164 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:47:40,164 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:47:40,164 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:47:40,164 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_malloc_true-termination.c.i_Iteration3_Lasso [2019-01-14 02:47:40,164 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:47:40,164 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:47:40,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:40,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:40,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:40,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:40,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:40,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:40,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:40,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:40,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:40,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:40,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:40,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:40,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:40,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:40,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:40,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:40,740 WARN L181 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2019-01-14 02:47:40,949 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-01-14 02:47:40,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:40,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:40,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:42,010 WARN L181 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-14 02:47:42,245 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-14 02:47:42,277 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:47:42,277 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:47:42,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:42,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:42,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:42,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:42,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:42,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:42,281 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:42,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:42,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:42,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:42,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:42,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:42,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:42,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:42,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:42,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:42,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:42,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:42,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:42,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:42,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:42,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:42,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:42,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:42,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:42,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:42,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:42,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:42,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:42,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:42,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:42,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:42,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:42,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:42,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:42,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:42,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:42,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:42,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:42,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:42,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:42,302 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:42,302 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:42,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:42,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:42,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:42,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:42,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:42,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:42,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:42,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:42,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:42,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:42,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:42,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:42,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:42,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:42,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:42,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:42,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:42,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:42,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:42,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:42,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:42,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:42,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:42,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:42,319 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:42,319 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:42,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:42,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:42,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:42,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:42,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:42,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:42,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:42,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:42,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:42,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:42,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:42,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:42,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:42,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:42,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:42,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:42,327 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:42,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:42,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:42,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:42,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:42,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:42,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:42,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:42,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:42,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:42,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:42,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:42,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:42,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:42,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:42,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:42,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:42,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:42,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:42,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:42,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:42,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:42,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:42,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:42,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:42,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:42,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:42,346 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:42,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:42,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:42,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:42,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:42,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:42,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:42,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:42,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:42,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:42,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:42,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:42,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:42,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:42,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:42,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:42,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:42,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:42,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:42,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:42,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:42,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:42,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:42,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:42,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:42,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:42,367 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:42,367 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:42,387 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:47:42,410 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 02:47:42,410 INFO L444 ModelExtractionUtils]: 49 out of 55 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-14 02:47:42,410 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:47:42,411 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:47:42,411 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:47:42,412 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_2, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_2 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2019-01-14 02:47:42,858 INFO L297 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2019-01-14 02:47:42,868 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:47:43,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:47:43,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:47:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:47:43,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:47:43,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:47:43,358 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 [2019-01-14 02:47:43,358 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-14 02:47:43,427 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 57 transitions. Complement of second has 5 states. [2019-01-14 02:47:43,429 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 [2019-01-14 02:47:43,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:47:43,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-01-14 02:47:43,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-14 02:47:43,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:43,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2019-01-14 02:47:43,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:43,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2019-01-14 02:47:43,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:43,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2019-01-14 02:47:43,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:47:43,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2019-01-14 02:47:43,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-14 02:47:43,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 02:47:43,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-01-14 02:47:43,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:47:43,437 INFO L706 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-01-14 02:47:43,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-01-14 02:47:43,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-01-14 02:47:43,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-14 02:47:43,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-01-14 02:47:43,442 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-14 02:47:43,443 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-14 02:47:43,443 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:47:43,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-01-14 02:47:43,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:47:43,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:47:43,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:47:43,446 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:47:43,447 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:47:43,447 INFO L794 eck$LassoCheckResult]: Stem: 374#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 367#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 368#L382 assume !(main_~length1~0 < 1); 369#L382-2 assume !(main_~length2~0 < 1); 366#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.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);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 362#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 363#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 376#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 372#L372-1 assume !cstrspn_#t~short210; 373#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209; 358#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 359#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 360#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 361#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 365#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 375#L372-5 [2019-01-14 02:47:43,447 INFO L796 eck$LassoCheckResult]: Loop: 375#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 370#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 371#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, 1 + cstrspn_#t~post211.offset;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 375#L372-5 [2019-01-14 02:47:43,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:43,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2019-01-14 02:47:43,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:43,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:43,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:43,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:43,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:47:43,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:47:43,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:47:43,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 02:47:43,921 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:47:43,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:43,922 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2019-01-14 02:47:43,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:43,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:43,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:43,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:43,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:43,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:44,106 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-01-14 02:47:44,485 WARN L181 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-14 02:47:44,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 02:47:44,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 02:47:44,486 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-01-14 02:47:44,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:47:44,664 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2019-01-14 02:47:44,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 02:47:44,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2019-01-14 02:47:44,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:47:44,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2019-01-14 02:47:44,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-14 02:47:44,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 02:47:44,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2019-01-14 02:47:44,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:47:44,668 INFO L706 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-01-14 02:47:44,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2019-01-14 02:47:44,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-01-14 02:47:44,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-14 02:47:44,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-01-14 02:47:44,671 INFO L729 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-01-14 02:47:44,671 INFO L609 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-01-14 02:47:44,671 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:47:44,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2019-01-14 02:47:44,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:47:44,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:47:44,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:47:44,673 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:47:44,673 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:47:44,673 INFO L794 eck$LassoCheckResult]: Stem: 442#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 439#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 440#L382 assume !(main_~length1~0 < 1); 441#L382-2 assume !(main_~length2~0 < 1); 438#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.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);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 434#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 435#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 448#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 452#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 451#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209; 430#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 431#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 432#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 433#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 437#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 447#L372-5 [2019-01-14 02:47:44,673 INFO L796 eck$LassoCheckResult]: Loop: 447#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 443#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 444#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, 1 + cstrspn_#t~post211.offset;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 447#L372-5 [2019-01-14 02:47:44,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:44,673 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2019-01-14 02:47:44,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:44,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:44,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:44,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:47:44,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:44,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:44,718 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2019-01-14 02:47:44,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:44,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:44,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:44,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:47:44,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:44,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:44,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:44,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2019-01-14 02:47:44,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:44,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:44,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:44,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:47:44,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:44,955 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-01-14 02:47:45,079 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-14 02:47:45,786 WARN L181 SmtUtils]: Spent 703.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 140 [2019-01-14 02:47:47,065 WARN L181 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 112 DAG size of output: 112 [2019-01-14 02:47:47,068 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:47:47,068 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:47:47,068 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:47:47,068 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:47:47,068 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:47:47,068 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:47:47,069 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:47:47,069 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:47:47,069 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_malloc_true-termination.c.i_Iteration5_Lasso [2019-01-14 02:47:47,069 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:47:47,069 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:47:47,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:47,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:47,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:47,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:47,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:47,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:47,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:47,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:47,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:47,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:47,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:47,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:47,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:47,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:47,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:47,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:47,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:47,394 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-14 02:47:48,502 WARN L181 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 115 DAG size of output: 100 [2019-01-14 02:47:48,682 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-01-14 02:47:48,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:48,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:48,869 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-01-14 02:47:48,984 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-14 02:47:49,109 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-01-14 02:47:49,785 WARN L181 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-01-14 02:47:50,043 WARN L181 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-14 02:47:50,173 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-01-14 02:47:50,682 WARN L181 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-14 02:47:50,724 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:47:50,724 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:47:50,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:50,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:50,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:50,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:50,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:50,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:50,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:50,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:50,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:50,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:50,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:50,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:50,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:50,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:50,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:50,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:50,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:50,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:50,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:50,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:50,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:50,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:50,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:50,741 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:50,741 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:50,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:50,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:50,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:50,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:50,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:50,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:50,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:50,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:50,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:50,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:50,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:50,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:50,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:50,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:50,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:50,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:50,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:50,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:50,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:50,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:50,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:50,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:50,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:50,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:50,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:50,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:50,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:50,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:50,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:50,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:50,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:50,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:50,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:50,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:50,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:50,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:50,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:50,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:50,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:50,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:50,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:50,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:50,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:50,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:50,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:50,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:50,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:50,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:50,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:50,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:50,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:50,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:50,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:50,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:50,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:50,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:50,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:50,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:50,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:50,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:50,775 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:50,775 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:50,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:50,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:50,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:50,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:50,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:50,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:50,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:50,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:50,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:50,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:50,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:50,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:50,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:50,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:50,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:50,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:50,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:50,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:50,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:50,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:50,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:50,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:50,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:50,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:50,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:50,791 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:50,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:50,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:50,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:50,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:50,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:50,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:50,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:50,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:50,797 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:50,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:50,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:50,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:50,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:50,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:50,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:50,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:50,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:50,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:50,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:50,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:50,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:50,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:50,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:50,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:50,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:50,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:50,804 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:50,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:50,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:50,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:50,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:50,805 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 02:47:50,806 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2019-01-14 02:47:50,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:50,859 INFO L402 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2019-01-14 02:47:50,860 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-01-14 02:47:51,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:51,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:51,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:51,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:51,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:51,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:51,018 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:51,018 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:51,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:51,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:51,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:51,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:51,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:51,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:51,023 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:51,023 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:51,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:51,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:51,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:51,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:51,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:51,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:51,033 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:51,033 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:51,055 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:47:51,102 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:47:51,103 INFO L444 ModelExtractionUtils]: 53 out of 58 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 02:47:51,103 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:47:51,106 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:47:51,107 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:47:51,107 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2019-01-14 02:47:51,907 INFO L297 tatePredicateManager]: 29 out of 30 supporting invariants were superfluous and have been removed [2019-01-14 02:47:51,933 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:47:51,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:47:52,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:47:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:47:52,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:47:52,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:47:52,070 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 [2019-01-14 02:47:52,070 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-14 02:47:52,161 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2019-01-14 02:47:52,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:47:52,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:47:52,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-14 02:47:52,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-14 02:47:52,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:52,164 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:47:52,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:47:52,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:47:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:47:52,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:47:52,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:47:52,262 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 02:47:52,263 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-14 02:47:52,318 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2019-01-14 02:47:52,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:47:52,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:47:52,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-14 02:47:52,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-14 02:47:52,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:52,322 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:47:52,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:52,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:47:52,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:47:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:47:52,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:47:52,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:47:52,444 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 02:47:52,444 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-14 02:47:52,509 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 53 transitions. Complement of second has 5 states. [2019-01-14 02:47:52,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:47:52,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:47:52,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-01-14 02:47:52,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-14 02:47:52,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:52,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2019-01-14 02:47:52,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:52,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2019-01-14 02:47:52,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:52,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2019-01-14 02:47:52,518 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:47:52,518 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2019-01-14 02:47:52,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:47:52,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:47:52,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:47:52,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:47:52,519 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:47:52,519 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:47:52,519 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:47:52,519 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:47:52,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:47:52,519 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:47:52,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:47:52,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:47:52 BoogieIcfgContainer [2019-01-14 02:47:52,527 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:47:52,527 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:47:52,527 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:47:52,527 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:47:52,528 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:47:33" (3/4) ... [2019-01-14 02:47:52,532 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:47:52,532 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:47:52,533 INFO L168 Benchmark]: Toolchain (without parser) took 19928.74 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 356.0 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -114.9 MB). Peak memory consumption was 241.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:47:52,534 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:47:52,535 INFO L168 Benchmark]: CACSL2BoogieTranslator took 664.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -151.7 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:47:52,536 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:47:52,537 INFO L168 Benchmark]: Boogie Preprocessor took 30.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:47:52,537 INFO L168 Benchmark]: RCFGBuilder took 518.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:47:52,538 INFO L168 Benchmark]: BuchiAutomizer took 18647.57 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 229.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.5 MB). Peak memory consumption was 242.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:47:52,539 INFO L168 Benchmark]: Witness Printer took 5.35 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:47:52,543 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 664.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -151.7 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 518.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 18647.57 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 229.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.5 MB). Peak memory consumption was 242.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.35 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[malloc(length1 * sizeof(char))] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[malloc(length2 * sizeof(char))] + -1 * s and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.6s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 16.8s. Construction of modules took 0.2s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 106 SDtfs, 92 SDslu, 67 SDs, 0 SdLazy, 103 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital382 mio100 ax100 hnf99 lsp91 ukn73 mio100 lsp32 div129 bol100 ite100 ukn100 eq171 hnf80 smp96 dnf599 smp43 tf100 neg96 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 211ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 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...