./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted-lit/cstrspn_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bcb247c8-cd90-407f-bb65-399db7e21c8f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bcb247c8-cd90-407f-bb65-399db7e21c8f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bcb247c8-cd90-407f-bb65-399db7e21c8f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bcb247c8-cd90-407f-bb65-399db7e21c8f/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted-lit/cstrspn_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_bcb247c8-cd90-407f-bb65-399db7e21c8f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bcb247c8-cd90-407f-bb65-399db7e21c8f/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0c74f0cc26425c1a044a70e86941b5dd82b132ff ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 22:07:02,756 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 22:07:02,757 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 22:07:02,763 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 22:07:02,763 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 22:07:02,764 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 22:07:02,764 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 22:07:02,765 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 22:07:02,766 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 22:07:02,766 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 22:07:02,767 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 22:07:02,767 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 22:07:02,767 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 22:07:02,768 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 22:07:02,768 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 22:07:02,769 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 22:07:02,769 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 22:07:02,770 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 22:07:02,771 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 22:07:02,772 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 22:07:02,772 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 22:07:02,773 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 22:07:02,774 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 22:07:02,774 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 22:07:02,774 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 22:07:02,775 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 22:07:02,775 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 22:07:02,776 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 22:07:02,776 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 22:07:02,776 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 22:07:02,777 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 22:07:02,777 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 22:07:02,777 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 22:07:02,777 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 22:07:02,778 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 22:07:02,778 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 22:07:02,778 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bcb247c8-cd90-407f-bb65-399db7e21c8f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-08 22:07:02,786 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 22:07:02,786 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 22:07:02,787 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 22:07:02,787 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 22:07:02,787 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 22:07:02,787 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 22:07:02,787 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 22:07:02,787 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 22:07:02,787 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 22:07:02,787 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 22:07:02,787 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 22:07:02,787 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 22:07:02,787 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 22:07:02,787 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 22:07:02,788 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 22:07:02,788 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 22:07:02,788 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 22:07:02,788 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 22:07:02,788 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 22:07:02,788 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 22:07:02,788 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 22:07:02,788 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 22:07:02,788 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 22:07:02,788 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 22:07:02,788 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 22:07:02,788 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 22:07:02,788 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 22:07:02,789 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 22:07:02,789 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 22:07:02,789 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_bcb247c8-cd90-407f-bb65-399db7e21c8f/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0c74f0cc26425c1a044a70e86941b5dd82b132ff [2018-12-08 22:07:02,807 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 22:07:02,816 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 22:07:02,819 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 22:07:02,820 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 22:07:02,820 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 22:07:02,820 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bcb247c8-cd90-407f-bb65-399db7e21c8f/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/cstrspn_true-termination_true-no-overflow.c [2018-12-08 22:07:02,857 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bcb247c8-cd90-407f-bb65-399db7e21c8f/bin-2019/uautomizer/data/5896611a1/bc44cb269e504f07ab6a6ccb2c5abcd5/FLAGd62638717 [2018-12-08 22:07:03,152 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 22:07:03,153 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bcb247c8-cd90-407f-bb65-399db7e21c8f/sv-benchmarks/c/termination-crafted-lit/cstrspn_true-termination_true-no-overflow.c [2018-12-08 22:07:03,158 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bcb247c8-cd90-407f-bb65-399db7e21c8f/bin-2019/uautomizer/data/5896611a1/bc44cb269e504f07ab6a6ccb2c5abcd5/FLAGd62638717 [2018-12-08 22:07:03,584 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bcb247c8-cd90-407f-bb65-399db7e21c8f/bin-2019/uautomizer/data/5896611a1/bc44cb269e504f07ab6a6ccb2c5abcd5 [2018-12-08 22:07:03,586 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 22:07:03,587 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 22:07:03,588 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 22:07:03,588 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 22:07:03,590 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 22:07:03,591 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:07:03" (1/1) ... [2018-12-08 22:07:03,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ed1acf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:07:03, skipping insertion in model container [2018-12-08 22:07:03,593 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:07:03" (1/1) ... [2018-12-08 22:07:03,598 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 22:07:03,609 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 22:07:03,696 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 22:07:03,702 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 22:07:03,712 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 22:07:03,720 INFO L195 MainTranslator]: Completed translation [2018-12-08 22:07:03,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:07:03 WrapperNode [2018-12-08 22:07:03,721 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 22:07:03,721 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 22:07:03,721 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 22:07:03,722 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 22:07:03,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:07:03" (1/1) ... [2018-12-08 22:07:03,731 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:07:03" (1/1) ... [2018-12-08 22:07:03,743 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 22:07:03,743 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 22:07:03,743 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 22:07:03,743 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 22:07:03,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:07:03" (1/1) ... [2018-12-08 22:07:03,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:07:03" (1/1) ... [2018-12-08 22:07:03,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:07:03" (1/1) ... [2018-12-08 22:07:03,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:07:03" (1/1) ... [2018-12-08 22:07:03,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:07:03" (1/1) ... [2018-12-08 22:07:03,788 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:07:03" (1/1) ... [2018-12-08 22:07:03,789 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:07:03" (1/1) ... [2018-12-08 22:07:03,790 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 22:07:03,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 22:07:03,790 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 22:07:03,790 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 22:07:03,791 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:07:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bcb247c8-cd90-407f-bb65-399db7e21c8f/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:07:03,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 22:07:03,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 22:07:03,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 22:07:03,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 22:07:03,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 22:07:03,943 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 22:07:03,943 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-12-08 22:07:03,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:07:03 BoogieIcfgContainer [2018-12-08 22:07:03,944 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 22:07:03,944 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 22:07:03,944 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 22:07:03,946 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 22:07:03,947 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 22:07:03,947 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 10:07:03" (1/3) ... [2018-12-08 22:07:03,947 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f18eb2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 10:07:03, skipping insertion in model container [2018-12-08 22:07:03,948 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 22:07:03,948 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:07:03" (2/3) ... [2018-12-08 22:07:03,948 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f18eb2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 10:07:03, skipping insertion in model container [2018-12-08 22:07:03,948 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 22:07:03,948 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:07:03" (3/3) ... [2018-12-08 22:07:03,949 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrspn_true-termination_true-no-overflow.c [2018-12-08 22:07:03,980 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 22:07:03,980 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 22:07:03,980 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 22:07:03,980 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 22:07:03,980 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 22:07:03,980 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 22:07:03,980 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 22:07:03,981 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 22:07:03,981 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 22:07:03,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-12-08 22:07:04,002 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-08 22:07:04,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 22:07:04,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 22:07:04,007 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:07:04,007 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-08 22:07:04,007 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 22:07:04,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-12-08 22:07:04,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-08 22:07:04,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 22:07:04,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 22:07:04,008 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:07:04,008 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-08 22:07:04,013 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 22#L14true assume !(build_nondet_String_~length~0 < 1); 19#L14-2true call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 10#L19true main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 16#L14-3true assume build_nondet_String_~length~0 < 1;build_nondet_String_~length~0 := 1; 12#L14-5true call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 8#L19-1true main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, 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; 4#L31-4true [2018-12-08 22:07:04,013 INFO L796 eck$LassoCheckResult]: Loop: 4#L31-4true call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 11#L31-1true assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 9#L34-5true assume !true; 5#L34-6true call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 23#L36true assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 6#L31-3true cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 4#L31-4true [2018-12-08 22:07:04,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:07:04,017 INFO L82 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 1 times [2018-12-08 22:07:04,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:07:04,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:07:04,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:07:04,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:07:04,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:07:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:07:04,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:07:04,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:07:04,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1602834410, now seen corresponding path program 1 times [2018-12-08 22:07:04,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:07:04,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:07:04,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:07:04,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:07:04,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:07:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:07:04,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:07:04,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:07:04,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 22:07:04,135 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 22:07:04,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-08 22:07:04,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 22:07:04,145 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-12-08 22:07:04,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:07:04,149 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2018-12-08 22:07:04,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-08 22:07:04,151 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2018-12-08 22:07:04,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-08 22:07:04,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 20 transitions. [2018-12-08 22:07:04,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-08 22:07:04,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-12-08 22:07:04,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2018-12-08 22:07:04,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 22:07:04,155 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-12-08 22:07:04,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2018-12-08 22:07:04,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-08 22:07:04,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-08 22:07:04,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-12-08 22:07:04,172 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-12-08 22:07:04,172 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-12-08 22:07:04,173 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 22:07:04,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2018-12-08 22:07:04,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-08 22:07:04,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 22:07:04,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 22:07:04,174 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:07:04,174 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:07:04,174 INFO L794 eck$LassoCheckResult]: Stem: 64#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 62#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 63#L14 assume !(build_nondet_String_~length~0 < 1); 65#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 58#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 59#L14-3 assume build_nondet_String_~length~0 < 1;build_nondet_String_~length~0 := 1; 60#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 55#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, 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; 50#L31-4 [2018-12-08 22:07:04,175 INFO L796 eck$LassoCheckResult]: Loop: 50#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 51#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 56#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 57#L34-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 61#L34-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; 52#L34-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 53#L36 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 54#L31-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 50#L31-4 [2018-12-08 22:07:04,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:07:04,175 INFO L82 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 2 times [2018-12-08 22:07:04,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:07:04,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:07:04,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:07:04,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:07:04,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:07:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:07:04,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:07:04,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:07:04,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 1 times [2018-12-08 22:07:04,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:07:04,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:07:04,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:07:04,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 22:07:04,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:07:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:07:04,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:07:04,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:07:04,224 INFO L82 PathProgramCache]: Analyzing trace with hash -955886854, now seen corresponding path program 1 times [2018-12-08 22:07:04,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:07:04,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:07:04,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:07:04,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:07:04,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:07:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:07:04,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:07:04,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:07:04,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 22:07:04,584 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-12-08 22:07:04,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 22:07:04,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 22:07:04,585 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 5 Second operand 7 states. [2018-12-08 22:07:04,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:07:04,692 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-12-08 22:07:04,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 22:07:04,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2018-12-08 22:07:04,693 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-12-08 22:07:04,693 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 35 transitions. [2018-12-08 22:07:04,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-12-08 22:07:04,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-12-08 22:07:04,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 35 transitions. [2018-12-08 22:07:04,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 22:07:04,694 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-12-08 22:07:04,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 35 transitions. [2018-12-08 22:07:04,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-12-08 22:07:04,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-08 22:07:04,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-12-08 22:07:04,696 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-12-08 22:07:04,696 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-12-08 22:07:04,696 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 22:07:04,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2018-12-08 22:07:04,697 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-12-08 22:07:04,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 22:07:04,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 22:07:04,697 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:07:04,697 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:07:04,698 INFO L794 eck$LassoCheckResult]: Stem: 134#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 131#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 132#L14 assume !(build_nondet_String_~length~0 < 1); 137#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 126#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 127#L14-3 assume !(build_nondet_String_~length~0 < 1); 129#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 130#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, 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; 142#L31-4 [2018-12-08 22:07:04,698 INFO L796 eck$LassoCheckResult]: Loop: 142#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 141#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 124#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 125#L34-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 138#L34-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; 139#L34-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 144#L36 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 143#L31-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 142#L31-4 [2018-12-08 22:07:04,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:07:04,698 INFO L82 PathProgramCache]: Analyzing trace with hash 176612300, now seen corresponding path program 1 times [2018-12-08 22:07:04,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:07:04,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:07:04,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:07:04,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:07:04,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:07:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:07:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:07:04,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:07:04,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 2 times [2018-12-08 22:07:04,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:07:04,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:07:04,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:07:04,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:07:04,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:07:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:07:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:07:04,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:07:04,724 INFO L82 PathProgramCache]: Analyzing trace with hash -254822276, now seen corresponding path program 1 times [2018-12-08 22:07:04,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:07:04,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:07:04,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:07:04,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 22:07:04,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:07:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:07:04,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:07:04,933 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-12-08 22:07:05,111 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 104 [2018-12-08 22:07:05,180 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 22:07:05,181 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 22:07:05,181 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 22:07:05,181 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 22:07:05,181 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 22:07:05,181 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:07:05,181 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 22:07:05,181 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 22:07:05,182 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_true-termination_true-no-overflow.c_Iteration3_Lasso [2018-12-08 22:07:05,182 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 22:07:05,182 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 22:07:05,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:05,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:05,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:05,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:05,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:05,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:05,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:05,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:05,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:05,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:05,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:05,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:05,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:05,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:05,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:05,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:05,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:05,737 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 22:07:05,740 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 22:07:05,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:07:05,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:07:05,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:07:05,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:07:05,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:07:05,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:07:05,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 22:07:05,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:07:05,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:07:05,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:07:05,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:07:05,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:07:05,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:07:05,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:07:05,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:07:05,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 22:07:05,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:07:05,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:07:05,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 [2018-12-08 22:07:05,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:07:05,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:07:05,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:07:05,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:07:05,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:07:05,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 22:07:05,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:07:05,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:07:05,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:07:05,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:07:05,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:07:05,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:07:05,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:07:05,750 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 22:07:05,750 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 22:07:05,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:07:05,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 [2018-12-08 22:07:05,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:07:05,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:07:05,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:07:05,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:07:05,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:07:05,754 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 22:07:05,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:07:05,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:07:05,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 [2018-12-08 22:07:05,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:07:05,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:07:05,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:07:05,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:07:05,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:07:05,756 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 22:07:05,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:07:05,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:07:05,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:07:05,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:07:05,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:07:05,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:07:05,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:07:05,759 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 22:07:05,759 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 22:07:05,776 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 22:07:05,792 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-08 22:07:05,792 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-08 22:07:05,794 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 22:07:05,795 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 22:07:05,795 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 22:07:05,796 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~sc1~0.offset, v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1) = -1*ULTIMATE.start_cstrspn_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1 Supporting invariants [] [2018-12-08 22:07:05,813 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2018-12-08 22:07:05,818 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 22:07:05,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:07:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:07:05,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:07:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:07:05,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:07:05,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:07:05,866 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 22:07:05,867 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-08 22:07:05,902 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 44 states and 52 transitions. Complement of second has 4 states. [2018-12-08 22:07:05,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 22:07:05,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 22:07:05,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2018-12-08 22:07:05,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 8 letters. [2018-12-08 22:07:05,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 22:07:05,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 16 letters. Loop has 8 letters. [2018-12-08 22:07:05,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 22:07:05,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 16 letters. [2018-12-08 22:07:05,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 22:07:05,905 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 52 transitions. [2018-12-08 22:07:05,906 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 22:07:05,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 22 states and 27 transitions. [2018-12-08 22:07:05,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-12-08 22:07:05,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-08 22:07:05,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2018-12-08 22:07:05,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 22:07:05,908 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-12-08 22:07:05,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2018-12-08 22:07:05,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-08 22:07:05,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-08 22:07:05,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2018-12-08 22:07:05,909 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-12-08 22:07:05,909 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-12-08 22:07:05,909 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 22:07:05,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2018-12-08 22:07:05,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 22:07:05,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 22:07:05,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 22:07:05,910 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:07:05,910 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 22:07:05,911 INFO L794 eck$LassoCheckResult]: Stem: 309#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 307#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 308#L14 assume !(build_nondet_String_~length~0 < 1); 311#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 302#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 303#L14-3 assume !(build_nondet_String_~length~0 < 1); 304#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 297#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, 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; 290#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 292#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 298#L34-5 [2018-12-08 22:07:05,911 INFO L796 eck$LassoCheckResult]: Loop: 298#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 299#L34-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 305#L34-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 298#L34-5 [2018-12-08 22:07:05,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:07:05,911 INFO L82 PathProgramCache]: Analyzing trace with hash -2074270767, now seen corresponding path program 1 times [2018-12-08 22:07:05,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:07:05,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:07:05,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:07:05,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:07:05,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:07:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:07:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:07:05,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:07:05,929 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 1 times [2018-12-08 22:07:05,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:07:05,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:07:05,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:07:05,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:07:05,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:07:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:07:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:07:05,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:07:05,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1389069017, now seen corresponding path program 1 times [2018-12-08 22:07:05,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:07:05,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:07:05,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:07:05,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:07:05,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:07:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:07:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:07:06,319 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 120 [2018-12-08 22:07:06,392 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 22:07:06,392 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 22:07:06,393 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 22:07:06,393 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 22:07:06,393 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 22:07:06,393 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:07:06,393 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 22:07:06,393 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 22:07:06,393 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_true-termination_true-no-overflow.c_Iteration4_Lasso [2018-12-08 22:07:06,393 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 22:07:06,393 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 22:07:06,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:06,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:06,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:06,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:06,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:06,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:06,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:06,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:06,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:06,596 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2018-12-08 22:07:06,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:06,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:06,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:06,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:06,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:06,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:06,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:06,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:07,048 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 22:07:07,049 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 22:07:07,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:07:07,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:07:07,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:07:07,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:07:07,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:07:07,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:07:07,050 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 22:07:07,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:07:07,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:07:07,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:07:07,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:07:07,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:07:07,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:07:07,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:07:07,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:07:07,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 22:07:07,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:07:07,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:07:07,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:07:07,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:07:07,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:07:07,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:07:07,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:07:07,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:07:07,052 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 22:07:07,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:07:07,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:07:07,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:07:07,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:07:07,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:07:07,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:07:07,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:07:07,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:07:07,053 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 22:07:07,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:07:07,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:07:07,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:07:07,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:07:07,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:07:07,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:07:07,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:07:07,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:07:07,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 22:07:07,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:07:07,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:07:07,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:07:07,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:07:07,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:07:07,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:07:07,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:07:07,056 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 22:07:07,056 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 22:07:07,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:07:07,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:07:07,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:07:07,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:07:07,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:07:07,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:07:07,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:07:07,058 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 22:07:07,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:07:07,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:07:07,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:07:07,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:07:07,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:07:07,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:07:07,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:07:07,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:07:07,059 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 22:07:07,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:07:07,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:07:07,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:07:07,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:07:07,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:07:07,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:07:07,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:07:07,060 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 22:07:07,060 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 22:07:07,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:07:07,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:07:07,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:07:07,062 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 22:07:07,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:07:07,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:07:07,063 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 22:07:07,063 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 22:07:07,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:07:07,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:07:07,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:07:07,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:07:07,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:07:07,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:07:07,068 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 22:07:07,068 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 22:07:07,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:07:07,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:07:07,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:07:07,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:07:07,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:07:07,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:07:07,072 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 22:07:07,072 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 22:07:07,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:07:07,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:07:07,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:07:07,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:07:07,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:07:07,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:07:07,073 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 22:07:07,073 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 22:07:07,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:07:07,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:07:07,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:07:07,075 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 22:07:07,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:07:07,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:07:07,076 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 22:07:07,076 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 22:07:07,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:07:07,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:07:07,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:07:07,082 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 22:07:07,082 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-12-08 22:07:07,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:07:07,093 INFO L402 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2018-12-08 22:07:07,093 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-12-08 22:07:07,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:07:07,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:07:07,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:07:07,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:07:07,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:07:07,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:07:07,142 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 22:07:07,142 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 22:07:07,149 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 22:07:07,160 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-08 22:07:07,160 INFO L444 ModelExtractionUtils]: 46 out of 52 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-08 22:07:07,160 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 22:07:07,161 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 22:07:07,161 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 22:07:07,161 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_2, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_2 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2018-12-08 22:07:07,192 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-12-08 22:07:07,193 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 22:07:07,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:07:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:07:07,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:07:07,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:07:07,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:07:07,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:07:07,262 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-12-08 22:07:07,262 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-12-08 22:07:07,306 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 49 states and 59 transitions. Complement of second has 7 states. [2018-12-08 22:07:07,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 22:07:07,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 22:07:07,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-12-08 22:07:07,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 3 letters. [2018-12-08 22:07:07,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 22:07:07,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 13 letters. Loop has 3 letters. [2018-12-08 22:07:07,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 22:07:07,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 6 letters. [2018-12-08 22:07:07,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 22:07:07,308 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 59 transitions. [2018-12-08 22:07:07,308 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 22:07:07,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 35 states and 42 transitions. [2018-12-08 22:07:07,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-08 22:07:07,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-08 22:07:07,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2018-12-08 22:07:07,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 22:07:07,309 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-12-08 22:07:07,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2018-12-08 22:07:07,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2018-12-08 22:07:07,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-08 22:07:07,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2018-12-08 22:07:07,310 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-12-08 22:07:07,310 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-12-08 22:07:07,310 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 22:07:07,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2018-12-08 22:07:07,311 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 22:07:07,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 22:07:07,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 22:07:07,311 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:07:07,311 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 22:07:07,311 INFO L794 eck$LassoCheckResult]: Stem: 498#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 496#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 497#L14 assume !(build_nondet_String_~length~0 < 1); 500#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 490#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 491#L14-3 assume !(build_nondet_String_~length~0 < 1); 493#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 485#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, 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; 477#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 478#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 492#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 499#L34-1 assume !cstrspn_#t~short7; 495#L34-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; 482#L34-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 483#L36 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 484#L31-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 479#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 481#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 486#L34-5 [2018-12-08 22:07:07,311 INFO L796 eck$LassoCheckResult]: Loop: 486#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 487#L34-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 494#L34-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 486#L34-5 [2018-12-08 22:07:07,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:07:07,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1703936771, now seen corresponding path program 1 times [2018-12-08 22:07:07,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:07:07,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:07:07,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:07:07,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:07:07,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:07:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:07:07,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:07:07,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:07:07,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 22:07:07,338 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 22:07:07,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:07:07,338 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 2 times [2018-12-08 22:07:07,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:07:07,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:07:07,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:07:07,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:07:07,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:07:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:07:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:07:07,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 22:07:07,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 22:07:07,440 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-12-08 22:07:07,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:07:07,486 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-12-08 22:07:07,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 22:07:07,486 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2018-12-08 22:07:07,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 22:07:07,487 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 31 transitions. [2018-12-08 22:07:07,487 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-08 22:07:07,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-08 22:07:07,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2018-12-08 22:07:07,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 22:07:07,488 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-12-08 22:07:07,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2018-12-08 22:07:07,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-08 22:07:07,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-08 22:07:07,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-12-08 22:07:07,490 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-12-08 22:07:07,490 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-12-08 22:07:07,490 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 22:07:07,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2018-12-08 22:07:07,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 22:07:07,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 22:07:07,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 22:07:07,491 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:07:07,491 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 22:07:07,491 INFO L794 eck$LassoCheckResult]: Stem: 573#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 568#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 569#L14 assume !(build_nondet_String_~length~0 < 1); 576#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 565#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 566#L14-3 assume !(build_nondet_String_~length~0 < 1); 567#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 560#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, 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; 552#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 553#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 572#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 574#L34-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 575#L34-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; 557#L34-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 558#L36 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 559#L31-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 554#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 556#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 561#L34-5 [2018-12-08 22:07:07,491 INFO L796 eck$LassoCheckResult]: Loop: 561#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 562#L34-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 570#L34-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 561#L34-5 [2018-12-08 22:07:07,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:07:07,491 INFO L82 PathProgramCache]: Analyzing trace with hash -71070591, now seen corresponding path program 2 times [2018-12-08 22:07:07,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:07:07,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:07:07,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:07:07,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 22:07:07,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:07:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:07:07,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:07:07,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:07:07,509 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 3 times [2018-12-08 22:07:07,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:07:07,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:07:07,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:07:07,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 22:07:07,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:07:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:07:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:07:07,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:07:07,514 INFO L82 PathProgramCache]: Analyzing trace with hash 154934313, now seen corresponding path program 1 times [2018-12-08 22:07:07,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:07:07,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:07:07,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:07:07,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 22:07:07,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:07:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:07:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:07:08,070 WARN L180 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 153 [2018-12-08 22:07:08,653 WARN L180 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 108 [2018-12-08 22:07:08,655 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 22:07:08,655 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 22:07:08,655 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 22:07:08,655 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 22:07:08,655 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 22:07:08,655 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:07:08,655 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 22:07:08,655 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 22:07:08,655 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_true-termination_true-no-overflow.c_Iteration6_Lasso [2018-12-08 22:07:08,655 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 22:07:08,655 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 22:07:08,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:08,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:08,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:08,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:08,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:08,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:08,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:08,761 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-08 22:07:09,128 WARN L180 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 93 [2018-12-08 22:07:09,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:09,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:09,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:09,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:09,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:09,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:09,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:09,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:09,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:09,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:07:09,556 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2018-12-08 22:07:09,766 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 22:07:09,766 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 22:07:09,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:07:09,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:07:09,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:07:09,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:07:09,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:07:09,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:07:09,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 22:07:09,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:07:09,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:07:09,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 [2018-12-08 22:07:09,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:07:09,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:07:09,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:07:09,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:07:09,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 22:07:09,769 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 22:07:09,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:07:09,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 [2018-12-08 22:07:09,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:07:09,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:07:09,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:07:09,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:07:09,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:07:09,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 22:07:09,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:07:09,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:07:09,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:07:09,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:07:09,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:07:09,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:07:09,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:07:09,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:07:09,772 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 22:07:09,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:07:09,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:07:09,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:07:09,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:07:09,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:07:09,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:07:09,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:07:09,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:07:09,774 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 22:07:09,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:07:09,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:07:09,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:07:09,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:07:09,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:07:09,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:07:09,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:07:09,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:07:09,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 22:07:09,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:07:09,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:07:09,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:07:09,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:07:09,776 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-12-08 22:07:09,776 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-12-08 22:07:09,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:07:09,788 INFO L402 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2018-12-08 22:07:09,788 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-12-08 22:07:09,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:07:09,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:07:09,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:07:09,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:07:09,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:07:09,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:07:09,847 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 22:07:09,848 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 22:07:09,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:07:09,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:07:09,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:07:09,849 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 22:07:09,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:07:09,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:07:09,849 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 22:07:09,850 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 22:07:09,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:07:09,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:07:09,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:07:09,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:07:09,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:07:09,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:07:09,853 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 22:07:09,853 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 22:07:09,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:07:09,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:07:09,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:07:09,855 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 22:07:09,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:07:09,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:07:09,857 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 22:07:09,857 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 22:07:09,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:07:09,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:07:09,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:07:09,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:07:09,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:07:09,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:07:09,863 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 22:07:09,863 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 22:07:09,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:07:09,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:07:09,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:07:09,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:07:09,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:07:09,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:07:09,865 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 22:07:09,865 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 22:07:09,873 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 22:07:09,882 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-12-08 22:07:09,882 INFO L444 ModelExtractionUtils]: 38 out of 46 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-08 22:07:09,882 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 22:07:09,883 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 22:07:09,883 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 22:07:09,883 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~s~0.offset, v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_3) = -1*ULTIMATE.start_cstrspn_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_3 Supporting invariants [] [2018-12-08 22:07:09,931 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2018-12-08 22:07:09,933 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 22:07:09,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:07:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:07:09,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:07:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:07:09,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:07:09,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:07:09,993 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-12-08 22:07:09,993 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-12-08 22:07:10,035 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 43 states and 48 transitions. Complement of second has 7 states. [2018-12-08 22:07:10,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 22:07:10,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 22:07:10,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-12-08 22:07:10,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 18 letters. Loop has 3 letters. [2018-12-08 22:07:10,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 22:07:10,036 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 22:07:10,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:07:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:07:10,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:07:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:07:10,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:07:10,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:07:10,099 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2018-12-08 22:07:10,099 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-12-08 22:07:10,131 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 43 states and 48 transitions. Complement of second has 7 states. [2018-12-08 22:07:10,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 22:07:10,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 22:07:10,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-12-08 22:07:10,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 18 letters. Loop has 3 letters. [2018-12-08 22:07:10,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 22:07:10,131 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 22:07:10,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:07:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:07:10,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:07:10,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:07:10,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:07:10,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:07:10,183 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-12-08 22:07:10,183 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-12-08 22:07:10,219 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 42 states and 48 transitions. Complement of second has 6 states. [2018-12-08 22:07:10,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 22:07:10,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 22:07:10,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-12-08 22:07:10,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-12-08 22:07:10,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 22:07:10,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 21 letters. Loop has 3 letters. [2018-12-08 22:07:10,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 22:07:10,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 18 letters. Loop has 6 letters. [2018-12-08 22:07:10,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 22:07:10,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 48 transitions. [2018-12-08 22:07:10,222 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 22:07:10,223 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 0 states and 0 transitions. [2018-12-08 22:07:10,223 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 22:07:10,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 22:07:10,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 22:07:10,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 22:07:10,223 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 22:07:10,223 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 22:07:10,223 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 22:07:10,223 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-08 22:07:10,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 22:07:10,223 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 22:07:10,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 22:07:10,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 10:07:10 BoogieIcfgContainer [2018-12-08 22:07:10,228 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 22:07:10,228 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 22:07:10,228 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 22:07:10,228 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 22:07:10,229 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:07:03" (3/4) ... [2018-12-08 22:07:10,231 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 22:07:10,231 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 22:07:10,232 INFO L168 Benchmark]: Toolchain (without parser) took 6645.44 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 388.0 MB). Free memory was 956.0 MB in the beginning and 1.2 GB in the end (delta: -207.7 MB). Peak memory consumption was 180.3 MB. Max. memory is 11.5 GB. [2018-12-08 22:07:10,233 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 22:07:10,233 INFO L168 Benchmark]: CACSL2BoogieTranslator took 133.29 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-08 22:07:10,233 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.43 ms. Allocated memory is still 1.0 GB. Free memory was 945.3 MB in the beginning and 939.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 22:07:10,234 INFO L168 Benchmark]: Boogie Preprocessor took 46.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -195.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-12-08 22:07:10,234 INFO L168 Benchmark]: RCFGBuilder took 153.65 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: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2018-12-08 22:07:10,235 INFO L168 Benchmark]: BuchiAutomizer took 6284.06 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 244.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -48.9 MB). Peak memory consumption was 196.0 MB. Max. memory is 11.5 GB. [2018-12-08 22:07:10,235 INFO L168 Benchmark]: Witness Printer took 3.08 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 22:07:10,238 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 133.29 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.43 ms. Allocated memory is still 1.0 GB. Free memory was 945.3 MB in the beginning and 939.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -195.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 153.65 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: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6284.06 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 244.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -48.9 MB). Peak memory consumption was 196.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.08 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 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 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[build_nondet_String()] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[malloc(length * sizeof(char))] + -1 * s and consists of 5 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[malloc(length * sizeof(char))] and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.2s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 5.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 129 SDtfs, 147 SDslu, 143 SDs, 0 SdLazy, 203 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital369 mio100 ax100 hnf99 lsp92 ukn69 mio100 lsp33 div137 bol100 ite100 ukn100 eq168 hnf75 smp88 dnf717 smp23 tf100 neg96 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 70ms 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...