./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-crafted-lit/cstrcspn_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1ddc6d26-94f9-4756-a5ef-38aad6b0ca8a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1ddc6d26-94f9-4756-a5ef-38aad6b0ca8a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1ddc6d26-94f9-4756-a5ef-38aad6b0ca8a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1ddc6d26-94f9-4756-a5ef-38aad6b0ca8a/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted-lit/cstrcspn_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_1ddc6d26-94f9-4756-a5ef-38aad6b0ca8a/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1ddc6d26-94f9-4756-a5ef-38aad6b0ca8a/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 f39f60c3148e6a8957b92a35d12d506fd8229368 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 07:22:04,757 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:22:04,759 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:22:04,767 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:22:04,767 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:22:04,768 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:22:04,769 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:22:04,770 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:22:04,771 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:22:04,772 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:22:04,772 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:22:04,772 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:22:04,773 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:22:04,774 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:22:04,774 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:22:04,775 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:22:04,775 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:22:04,777 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:22:04,778 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:22:04,779 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:22:04,780 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:22:04,781 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:22:04,782 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:22:04,782 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:22:04,782 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:22:04,783 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:22:04,784 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:22:04,784 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:22:04,785 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:22:04,785 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:22:04,786 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:22:04,786 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:22:04,786 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:22:04,786 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:22:04,787 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:22:04,787 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:22:04,788 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1ddc6d26-94f9-4756-a5ef-38aad6b0ca8a/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 07:22:04,798 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:22:04,798 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:22:04,799 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:22:04,800 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:22:04,800 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 07:22:04,800 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 07:22:04,801 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 07:22:04,801 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 07:22:04,801 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 07:22:04,801 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 07:22:04,801 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 07:22:04,801 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:22:04,802 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 07:22:04,802 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:22:04,802 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:22:04,802 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 07:22:04,802 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 07:22:04,802 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 07:22:04,802 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:22:04,803 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 07:22:04,803 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 07:22:04,803 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:22:04,803 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:22:04,803 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 07:22:04,803 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:22:04,804 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 07:22:04,804 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 07:22:04,804 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 07:22:04,805 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_1ddc6d26-94f9-4756-a5ef-38aad6b0ca8a/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 -> f39f60c3148e6a8957b92a35d12d506fd8229368 [2018-11-10 07:22:04,826 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:22:04,834 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:22:04,837 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:22:04,838 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:22:04,838 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:22:04,838 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1ddc6d26-94f9-4756-a5ef-38aad6b0ca8a/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/cstrcspn_true-termination_true-no-overflow.c [2018-11-10 07:22:04,873 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1ddc6d26-94f9-4756-a5ef-38aad6b0ca8a/bin-2019/uautomizer/data/293952cb1/36ab58afdd294cefb9ae83c75c9ff86e/FLAG3fc257f10 [2018-11-10 07:22:05,260 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:22:05,261 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1ddc6d26-94f9-4756-a5ef-38aad6b0ca8a/sv-benchmarks/c/termination-crafted-lit/cstrcspn_true-termination_true-no-overflow.c [2018-11-10 07:22:05,264 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1ddc6d26-94f9-4756-a5ef-38aad6b0ca8a/bin-2019/uautomizer/data/293952cb1/36ab58afdd294cefb9ae83c75c9ff86e/FLAG3fc257f10 [2018-11-10 07:22:05,275 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1ddc6d26-94f9-4756-a5ef-38aad6b0ca8a/bin-2019/uautomizer/data/293952cb1/36ab58afdd294cefb9ae83c75c9ff86e [2018-11-10 07:22:05,277 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:22:05,278 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:22:05,279 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:22:05,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:22:05,281 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:22:05,281 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:22:05" (1/1) ... [2018-11-10 07:22:05,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61785316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:22:05, skipping insertion in model container [2018-11-10 07:22:05,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:22:05" (1/1) ... [2018-11-10 07:22:05,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:22:05,301 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:22:05,400 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:22:05,405 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:22:05,415 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:22:05,424 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:22:05,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:22:05 WrapperNode [2018-11-10 07:22:05,424 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:22:05,425 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:22:05,425 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:22:05,425 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:22:05,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:22:05" (1/1) ... [2018-11-10 07:22:05,436 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:22:05" (1/1) ... [2018-11-10 07:22:05,450 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:22:05,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:22:05,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:22:05,451 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:22:05,457 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:22:05" (1/1) ... [2018-11-10 07:22:05,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:22:05" (1/1) ... [2018-11-10 07:22:05,459 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:22:05" (1/1) ... [2018-11-10 07:22:05,459 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:22:05" (1/1) ... [2018-11-10 07:22:05,465 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:22:05" (1/1) ... [2018-11-10 07:22:05,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:22:05" (1/1) ... [2018-11-10 07:22:05,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:22:05" (1/1) ... [2018-11-10 07:22:05,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:22:05,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:22:05,472 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:22:05,472 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:22:05,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:22:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1ddc6d26-94f9-4756-a5ef-38aad6b0ca8a/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-11-10 07:22:05,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 07:22:05,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:22:05,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:22:05,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 07:22:05,816 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:22:05,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:22:05 BoogieIcfgContainer [2018-11-10 07:22:05,817 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:22:05,817 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 07:22:05,817 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 07:22:05,819 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 07:22:05,820 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:22:05,820 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 07:22:05" (1/3) ... [2018-11-10 07:22:05,821 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4518b29f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:22:05, skipping insertion in model container [2018-11-10 07:22:05,821 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:22:05,821 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:22:05" (2/3) ... [2018-11-10 07:22:05,822 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4518b29f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:22:05, skipping insertion in model container [2018-11-10 07:22:05,822 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:22:05,822 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:22:05" (3/3) ... [2018-11-10 07:22:05,823 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcspn_true-termination_true-no-overflow.c [2018-11-10 07:22:05,868 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:22:05,869 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 07:22:05,869 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 07:22:05,869 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 07:22:05,869 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:22:05,869 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:22:05,869 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 07:22:05,869 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:22:05,869 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 07:22:05,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-11-10 07:22:05,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:22:05,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:22:05,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:22:05,902 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:22:05,902 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:22:05,902 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 07:22:05,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-11-10 07:22:05,904 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:22:05,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:22:05,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:22:05,904 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:22:05,904 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:22:05,909 INFO L793 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;assume { :begin_inline_build_nondet_String } true;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; 21#L14true assume !(build_nondet_String_~length~0 < 1); 16#L14-2true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 9#L18true SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18 7#L18-1true build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 26#L19true main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;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; 15#L14-3true assume !(build_nondet_String_~length~0 < 1); 27#L14-5true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 5#L18-2true SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18-2 3#L18-3true build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 24#L19-1true main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 34#L30-5true [2018-11-10 07:22:05,909 INFO L795 eck$LassoCheckResult]: Loop: 34#L30-5true assume true; 25#L30-1true SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L30-1 23#L30-2true assume !!(cstrcspn_#t~mem3 != 0);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 14#L32true SUMMARY for call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L32 13#L32-1true cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 19#L33-9true assume !true; 18#L33-10true SUMMARY for call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L33-10 33#L35true assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 22#L30-4true cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset + 1;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 34#L30-5true [2018-11-10 07:22:05,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:22:05,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1755105166, now seen corresponding path program 1 times [2018-11-10 07:22:05,913 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:22:05,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:22:05,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:22:05,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:22:05,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:22:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:22:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:22:06,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:22:06,006 INFO L82 PathProgramCache]: Analyzing trace with hash 883669989, now seen corresponding path program 1 times [2018-11-10 07:22:06,006 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:22:06,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:22:06,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:22:06,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:22:06,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:22:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:22:06,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:22:06,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:22:06,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 07:22:06,031 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:22:06,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 07:22:06,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 07:22:06,046 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-11-10 07:22:06,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:22:06,051 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2018-11-10 07:22:06,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 07:22:06,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2018-11-10 07:22:06,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:22:06,056 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 27 states and 31 transitions. [2018-11-10 07:22:06,056 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-10 07:22:06,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-10 07:22:06,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2018-11-10 07:22:06,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:22:06,057 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-10 07:22:06,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2018-11-10 07:22:06,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-10 07:22:06,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-10 07:22:06,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-10 07:22:06,075 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-10 07:22:06,075 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-10 07:22:06,075 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 07:22:06,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2018-11-10 07:22:06,075 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:22:06,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:22:06,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:22:06,076 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:22:06,076 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:22:06,076 INFO L793 eck$LassoCheckResult]: Stem: 98#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 84#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;assume { :begin_inline_build_nondet_String } true;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; 85#L14 assume !(build_nondet_String_~length~0 < 1); 90#L14-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 81#L18 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18 78#L18-1 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 79#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;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; 88#L14-3 assume !(build_nondet_String_~length~0 < 1); 89#L14-5 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 77#L18-2 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18-2 72#L18-3 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 73#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 94#L30-5 [2018-11-10 07:22:06,076 INFO L795 eck$LassoCheckResult]: Loop: 94#L30-5 assume true; 96#L30-1 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L30-1 95#L30-2 assume !!(cstrcspn_#t~mem3 != 0);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 87#L32 SUMMARY for call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L32 86#L32-1 cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 76#L33-9 assume true; 92#L33-1 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L33-1 97#L33-2 cstrcspn_#t~short7 := cstrcspn_#t~mem5 != 0; 83#L33-3 assume !cstrcspn_#t~short7; 74#L33-7 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6; 75#L33-10 SUMMARY for call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L33-10 91#L35 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 93#L30-4 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset + 1;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 94#L30-5 [2018-11-10 07:22:06,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:22:06,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1755105166, now seen corresponding path program 2 times [2018-11-10 07:22:06,077 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:22:06,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:22:06,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:22:06,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:22:06,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:22:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:22:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:22:06,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:22:06,108 INFO L82 PathProgramCache]: Analyzing trace with hash 311113554, now seen corresponding path program 1 times [2018-11-10 07:22:06,108 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:22:06,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:22:06,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:22:06,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:22:06,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:22:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:22:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:22:06,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:22:06,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1448205541, now seen corresponding path program 1 times [2018-11-10 07:22:06,125 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:22:06,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:22:06,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:22:06,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:22:06,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:22:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:22:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:22:06,309 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2018-11-10 07:22:06,682 WARN L179 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 122 [2018-11-10 07:22:06,773 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:22:06,774 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:22:06,774 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:22:06,774 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:22:06,775 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:22:06,775 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:22:06,775 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:22:06,775 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:22:06,775 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_true-termination_true-no-overflow.c_Iteration2_Lasso [2018-11-10 07:22:06,775 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:22:06,776 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:22:06,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:22:06,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:22:06,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:22:06,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:22:06,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:22:06,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:22:06,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:22:06,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:22:06,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:22:06,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:22:06,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:22:07,027 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2018-11-10 07:22:07,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:22:07,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:22:07,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:22:07,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:22:07,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:22:07,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:22:07,436 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:22:07,439 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:22:07,441 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:22:07,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:22:07,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:22:07,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:22:07,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:22:07,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:22:07,444 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:22:07,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:22:07,445 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:22:07,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:22:07,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:22:07,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:22:07,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:22:07,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:22:07,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:22:07,446 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:22:07,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:22:07,447 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:22:07,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:22:07,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:22:07,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:22:07,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:22:07,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:22:07,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:22:07,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:22:07,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:22:07,450 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:22:07,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:22:07,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:22:07,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:22:07,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:22:07,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:22:07,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:22:07,451 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:22:07,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:22:07,452 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:22:07,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-10 07:22:07,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:22:07,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:22:07,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:22:07,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:22:07,456 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:22:07,456 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:22:07,459 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:22:07,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:22:07,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:22:07,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:22:07,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:22:07,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:22:07,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:22:07,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:22:07,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:22:07,461 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:22:07,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:22:07,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:22:07,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:22:07,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:22:07,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:22:07,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:22:07,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:22:07,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:22:07,464 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:22:07,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:22:07,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:22:07,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:22:07,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:22:07,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:22:07,466 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:22:07,466 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:22:07,469 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:22:07,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:22:07,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:22:07,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:22:07,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:22:07,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:22:07,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:22:07,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:22:07,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:22:07,471 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:22:07,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:22:07,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:22:07,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:22:07,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:22:07,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:22:07,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:22:07,473 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:22:07,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:22:07,474 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:22:07,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-10 07:22:07,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:22:07,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:22:07,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:22:07,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:22:07,476 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:22:07,476 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:22:07,478 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:22:07,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-10 07:22:07,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:22:07,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:22:07,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:22:07,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:22:07,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:22:07,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:22:07,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:22:07,480 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:22:07,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-10 07:22:07,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:22:07,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:22:07,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:22:07,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:22:07,486 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:22:07,487 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:22:07,489 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:22:07,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-10 07:22:07,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:22:07,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:22:07,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:22:07,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:22:07,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:22:07,494 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:22:07,512 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:22:07,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:22:07,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:22:07,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:22:07,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:22:07,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:22:07,515 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:22:07,515 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:22:07,529 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:22:07,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-10 07:22:07,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:22:07,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:22:07,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:22:07,530 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 07:22:07,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:22:07,531 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 07:22:07,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:22:07,536 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:22:07,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:22:07,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:22:07,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:22:07,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:22:07,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:22:07,538 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:22:07,538 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:22:07,543 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:22:07,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-10 07:22:07,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:22:07,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:22:07,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:22:07,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:22:07,545 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:22:07,545 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:22:07,547 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:22:07,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:22:07,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:22:07,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:22:07,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:22:07,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:22:07,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:22:07,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:22:07,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:22:07,550 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:22:07,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:22:07,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:22:07,551 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 07:22:07,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:22:07,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:22:07,553 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 07:22:07,553 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:22:07,564 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:22:07,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-10 07:22:07,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:22:07,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:22:07,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:22:07,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:22:07,568 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:22:07,568 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:22:07,599 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:22:07,612 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 07:22:07,613 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 07:22:07,614 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:22:07,615 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 07:22:07,616 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:22:07,616 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~sc1~0.offset, v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1) = -1*ULTIMATE.start_cstrcspn_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1 Supporting invariants [] [2018-11-10 07:22:07,656 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2018-11-10 07:22:07,666 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 07:22:07,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:22:07,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:22:07,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:22:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:22:07,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:22:07,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:22:07,746 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-11-10 07:22:07,747 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-10 07:22:07,820 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 42 states and 49 transitions. Complement of second has 6 states. [2018-11-10 07:22:07,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 07:22:07,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 07:22:07,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2018-11-10 07:22:07,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 12 letters. Loop has 13 letters. [2018-11-10 07:22:07,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:22:07,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 25 letters. Loop has 13 letters. [2018-11-10 07:22:07,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:22:07,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 12 letters. Loop has 26 letters. [2018-11-10 07:22:07,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:22:07,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 49 transitions. [2018-11-10 07:22:07,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 07:22:07,826 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 39 states and 46 transitions. [2018-11-10 07:22:07,826 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-10 07:22:07,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-10 07:22:07,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 46 transitions. [2018-11-10 07:22:07,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:22:07,826 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-10 07:22:07,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 46 transitions. [2018-11-10 07:22:07,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-10 07:22:07,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-10 07:22:07,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-11-10 07:22:07,828 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-10 07:22:07,828 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-10 07:22:07,828 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 07:22:07,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2018-11-10 07:22:07,829 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 07:22:07,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:22:07,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:22:07,830 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:22:07,830 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 07:22:07,830 INFO L793 eck$LassoCheckResult]: Stem: 310#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 289#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;assume { :begin_inline_build_nondet_String } true;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; 290#L14 assume !(build_nondet_String_~length~0 < 1); 297#L14-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 284#L18 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18 280#L18-1 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 281#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;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; 295#L14-3 assume !(build_nondet_String_~length~0 < 1); 296#L14-5 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 279#L18-2 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18-2 272#L18-3 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 273#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 305#L30-5 assume true; 306#L30-1 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L30-1 303#L30-2 assume !!(cstrcspn_#t~mem3 != 0);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 293#L32 SUMMARY for call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L32 291#L32-1 cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 275#L33-9 [2018-11-10 07:22:07,830 INFO L795 eck$LassoCheckResult]: Loop: 275#L33-9 assume true; 299#L33-1 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L33-1 308#L33-2 cstrcspn_#t~short7 := cstrcspn_#t~mem5 != 0; 287#L33-3 assume !cstrcspn_#t~short7; 274#L33-7 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset + 1;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 275#L33-9 [2018-11-10 07:22:07,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:22:07,830 INFO L82 PathProgramCache]: Analyzing trace with hash 556795412, now seen corresponding path program 1 times [2018-11-10 07:22:07,830 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:22:07,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:22:07,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:22:07,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:22:07,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:22:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:22:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:22:07,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:22:07,852 INFO L82 PathProgramCache]: Analyzing trace with hash 66864142, now seen corresponding path program 1 times [2018-11-10 07:22:07,852 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:22:07,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:22:07,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:22:07,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:22:07,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:22:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:22:07,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:22:07,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:22:07,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 07:22:07,863 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:22:07,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:22:07,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:22:07,864 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-10 07:22:07,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:22:07,885 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-10 07:22:07,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:22:07,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 47 transitions. [2018-11-10 07:22:07,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 07:22:07,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 40 states and 46 transitions. [2018-11-10 07:22:07,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-10 07:22:07,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-10 07:22:07,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 46 transitions. [2018-11-10 07:22:07,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:22:07,888 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-11-10 07:22:07,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 46 transitions. [2018-11-10 07:22:07,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-10 07:22:07,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-10 07:22:07,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-11-10 07:22:07,890 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-11-10 07:22:07,891 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-11-10 07:22:07,891 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 07:22:07,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 46 transitions. [2018-11-10 07:22:07,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 07:22:07,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:22:07,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:22:07,892 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:22:07,892 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:22:07,892 INFO L793 eck$LassoCheckResult]: Stem: 397#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 378#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;assume { :begin_inline_build_nondet_String } true;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; 379#L14 assume !(build_nondet_String_~length~0 < 1); 384#L14-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 370#L18 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18 365#L18-1 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 366#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;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; 382#L14-3 assume !(build_nondet_String_~length~0 < 1); 383#L14-5 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 364#L18-2 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18-2 358#L18-3 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 359#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 392#L30-5 assume true; 393#L30-1 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L30-1 390#L30-2 assume !!(cstrcspn_#t~mem3 != 0);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 380#L32 SUMMARY for call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L32 375#L32-1 cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 361#L33-9 [2018-11-10 07:22:07,892 INFO L795 eck$LassoCheckResult]: Loop: 361#L33-9 assume true; 386#L33-1 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L33-1 395#L33-2 cstrcspn_#t~short7 := cstrcspn_#t~mem5 != 0; 373#L33-3 assume cstrcspn_#t~short7; 371#L33-4 SUMMARY for call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L33-4 367#L33-5 cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 360#L33-7 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset + 1;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 361#L33-9 [2018-11-10 07:22:07,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:22:07,893 INFO L82 PathProgramCache]: Analyzing trace with hash 556795412, now seen corresponding path program 2 times [2018-11-10 07:22:07,893 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:22:07,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:22:07,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:22:07,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:22:07,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:22:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:22:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:22:07,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:22:07,912 INFO L82 PathProgramCache]: Analyzing trace with hash -168195247, now seen corresponding path program 1 times [2018-11-10 07:22:07,912 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:22:07,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:22:07,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:22:07,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:22:07,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:22:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:22:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:22:07,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:22:07,921 INFO L82 PathProgramCache]: Analyzing trace with hash 462232030, now seen corresponding path program 1 times [2018-11-10 07:22:07,921 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:22:07,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:22:07,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:22:07,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:22:07,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:22:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:22:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:22:08,384 WARN L179 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 140 [2018-11-10 07:22:08,471 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:22:08,472 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:22:08,472 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:22:08,472 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:22:08,472 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:22:08,472 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:22:08,472 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:22:08,472 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:22:08,472 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_true-termination_true-no-overflow.c_Iteration4_Lasso [2018-11-10 07:22:08,472 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:22:08,472 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:22:08,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:22:08,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:22:08,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:22:08,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:22:08,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:22:08,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:22:08,695 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 99 [2018-11-10 07:22:08,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:22:08,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:22:08,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:22:08,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:22:08,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:22:08,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:22:08,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:22:08,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:22:08,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:22:08,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:22:08,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:22:09,264 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:22:09,264 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:22:09,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-10 07:22:09,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:22:09,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:22:09,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:22:09,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:22:09,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:22:09,266 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:22:09,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:22:09,267 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:22:09,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:22:09,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:22:09,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:22:09,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:22:09,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:22:09,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:22:09,268 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:22:09,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:22:09,269 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:22:09,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-10 07:22:09,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:22:09,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:22:09,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:22:09,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:22:09,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:22:09,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:22:09,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:22:09,270 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:22:09,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:22:09,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:22:09,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:22:09,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:22:09,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:22:09,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:22:09,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:22:09,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:22:09,272 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:22:09,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-10 07:22:09,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:22:09,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:22:09,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:22:09,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:22:09,273 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:22:09,273 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:22:09,274 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:22:09,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:22:09,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:22:09,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:22:09,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:22:09,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:22:09,276 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:22:09,276 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:22:09,278 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:22:09,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-10 07:22:09,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:22:09,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:22:09,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:22:09,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:22:09,280 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:22:09,280 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:22:09,281 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:22:09,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-10 07:22:09,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:22:09,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:22:09,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:22:09,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:22:09,283 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:22:09,283 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:22:09,287 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:22:09,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-10 07:22:09,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:22:09,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:22:09,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:22:09,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:22:09,289 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:22:09,289 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:22:09,291 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:22:09,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:22:09,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:22:09,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:22:09,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:22:09,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:22:09,293 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:22:09,293 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:22:09,295 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:22:09,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-10 07:22:09,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:22:09,295 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 07:22:09,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:22:09,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:22:09,297 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 07:22:09,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:22:09,301 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:22:09,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:22:09,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:22:09,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:22:09,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:22:09,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:22:09,302 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:22:09,302 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:22:09,303 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:22:09,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-10 07:22:09,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:22:09,304 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 07:22:09,304 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-10 07:22:09,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:22:09,319 INFO L402 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2018-11-10 07:22:09,319 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-10 07:22:09,396 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:22:09,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-10 07:22:09,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:22:09,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:22:09,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:22:09,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:22:09,397 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:22:09,397 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:22:09,399 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:22:09,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:22:09,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:22:09,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:22:09,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:22:09,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:22:09,402 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:22:09,402 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:22:09,414 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:22:09,426 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 07:22:09,426 INFO L444 ModelExtractionUtils]: 38 out of 43 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 07:22:09,426 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:22:09,427 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 07:22:09,427 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:22:09,427 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0.offset, v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2) = -1*ULTIMATE.start_cstrcspn_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2 Supporting invariants [] [2018-11-10 07:22:09,464 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-11-10 07:22:09,466 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:22:09,466 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 07:22:09,466 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 07:22:09,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:22:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:22:09,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:22:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:22:09,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:22:09,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:22:09,559 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2018-11-10 07:22:09,559 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 46 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-11-10 07:22:09,659 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 46 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 93 states and 104 transitions. Complement of second has 11 states. [2018-11-10 07:22:09,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 07:22:09,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 07:22:09,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2018-11-10 07:22:09,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 17 letters. Loop has 7 letters. [2018-11-10 07:22:09,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:22:09,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 24 letters. Loop has 7 letters. [2018-11-10 07:22:09,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:22:09,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 17 letters. Loop has 14 letters. [2018-11-10 07:22:09,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:22:09,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 104 transitions. [2018-11-10 07:22:09,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 07:22:09,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 66 states and 74 transitions. [2018-11-10 07:22:09,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-10 07:22:09,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-10 07:22:09,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 74 transitions. [2018-11-10 07:22:09,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:22:09,664 INFO L705 BuchiCegarLoop]: Abstraction has 66 states and 74 transitions. [2018-11-10 07:22:09,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 74 transitions. [2018-11-10 07:22:09,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-11-10 07:22:09,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-10 07:22:09,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-11-10 07:22:09,668 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-11-10 07:22:09,668 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-11-10 07:22:09,668 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 07:22:09,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 63 transitions. [2018-11-10 07:22:09,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 07:22:09,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:22:09,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:22:09,670 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:22:09,670 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:22:09,670 INFO L793 eck$LassoCheckResult]: Stem: 695#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 669#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;assume { :begin_inline_build_nondet_String } true;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; 670#L14 assume !(build_nondet_String_~length~0 < 1); 679#L14-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 662#L18 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18 657#L18-1 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 658#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;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; 677#L14-3 assume !(build_nondet_String_~length~0 < 1); 678#L14-5 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 656#L18-2 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18-2 650#L18-3 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 651#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 690#L30-5 assume true; 696#L30-1 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L30-1 703#L30-2 assume !!(cstrcspn_#t~mem3 != 0);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 675#L32 SUMMARY for call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L32 676#L32-1 cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 655#L33-9 assume true; 684#L33-1 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L33-1 694#L33-2 cstrcspn_#t~short7 := cstrcspn_#t~mem5 != 0; 667#L33-3 assume !cstrcspn_#t~short7; 661#L33-7 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6; 680#L33-10 SUMMARY for call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L33-10 681#L35 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 685#L30-4 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset + 1;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 686#L30-5 assume true; 691#L30-1 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L30-1 687#L30-2 assume !!(cstrcspn_#t~mem3 != 0);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 674#L32 SUMMARY for call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L32 671#L32-1 cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 653#L33-9 [2018-11-10 07:22:09,670 INFO L795 eck$LassoCheckResult]: Loop: 653#L33-9 assume true; 682#L33-1 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L33-1 693#L33-2 cstrcspn_#t~short7 := cstrcspn_#t~mem5 != 0; 666#L33-3 assume cstrcspn_#t~short7; 663#L33-4 SUMMARY for call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L33-4 659#L33-5 cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 652#L33-7 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset + 1;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 653#L33-9 [2018-11-10 07:22:09,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:22:09,670 INFO L82 PathProgramCache]: Analyzing trace with hash -422203619, now seen corresponding path program 2 times [2018-11-10 07:22:09,670 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:22:09,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:22:09,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:22:09,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:22:09,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:22:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:22:09,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:22:09,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:22:09,689 INFO L82 PathProgramCache]: Analyzing trace with hash -168195247, now seen corresponding path program 2 times [2018-11-10 07:22:09,689 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:22:09,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:22:09,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:22:09,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:22:09,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:22:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:22:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:22:09,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:22:09,696 INFO L82 PathProgramCache]: Analyzing trace with hash -271457099, now seen corresponding path program 1 times [2018-11-10 07:22:09,696 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:22:09,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:22:09,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:22:09,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:22:09,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:22:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:22:09,780 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:22:09,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:22:09,780 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1ddc6d26-94f9-4756-a5ef-38aad6b0ca8a/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:22:09,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:22:09,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:22:09,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:22:09,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-11-10 07:22:09,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-10 07:22:09,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:22:09,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:22:09,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 07:22:09,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:14, output treesize:10 [2018-11-10 07:22:41,218 WARN L179 SmtUtils]: Spent 975.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-10 07:23:06,649 WARN L179 SmtUtils]: Spent 1.41 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-10 07:23:20,953 WARN L179 SmtUtils]: Spent 1.42 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-10 07:23:20,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-11-10 07:23:20,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-11-10 07:23:20,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:23:20,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:23:20,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:23:20,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2018-11-10 07:23:20,970 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:23:20,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:23:20,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 18 [2018-11-10 07:23:21,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 07:23:21,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=254, Unknown=7, NotChecked=0, Total=306 [2018-11-10 07:23:21,085 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. cyclomatic complexity: 10 Second operand 18 states. [2018-11-10 07:23:25,308 WARN L179 SmtUtils]: Spent 3.95 s on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2018-11-10 07:23:27,966 WARN L179 SmtUtils]: Spent 2.64 s on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2018-11-10 07:23:30,289 WARN L179 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2018-11-10 07:23:30,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:23:30,292 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2018-11-10 07:23:30,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 07:23:30,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 125 transitions. [2018-11-10 07:23:30,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 07:23:30,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 92 states and 102 transitions. [2018-11-10 07:23:30,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-10 07:23:30,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-10 07:23:30,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 102 transitions. [2018-11-10 07:23:30,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:23:30,295 INFO L705 BuchiCegarLoop]: Abstraction has 92 states and 102 transitions. [2018-11-10 07:23:30,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 102 transitions. [2018-11-10 07:23:30,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 64. [2018-11-10 07:23:30,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-10 07:23:30,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2018-11-10 07:23:30,300 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 72 transitions. [2018-11-10 07:23:30,300 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 72 transitions. [2018-11-10 07:23:30,300 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 07:23:30,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 72 transitions. [2018-11-10 07:23:30,301 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 07:23:30,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:23:30,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:23:30,302 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:23:30,302 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:23:30,302 INFO L793 eck$LassoCheckResult]: Stem: 1016#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 993#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;assume { :begin_inline_build_nondet_String } true;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; 994#L14 assume !(build_nondet_String_~length~0 < 1); 1000#L14-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 985#L18 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18 980#L18-1 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 981#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;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; 998#L14-3 assume !(build_nondet_String_~length~0 < 1); 999#L14-5 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 979#L18-2 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18-2 973#L18-3 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 974#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 1010#L30-5 assume true; 1017#L30-1 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L30-1 1025#L30-2 assume !!(cstrcspn_#t~mem3 != 0);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 996#L32 SUMMARY for call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L32 997#L32-1 cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 1024#L33-9 assume true; 1035#L33-1 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L33-1 1033#L33-2 cstrcspn_#t~short7 := cstrcspn_#t~mem5 != 0; 989#L33-3 assume cstrcspn_#t~short7; 987#L33-4 SUMMARY for call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L33-4 983#L33-5 cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 984#L33-7 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6; 1001#L33-10 SUMMARY for call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L33-10 1002#L35 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 1005#L30-4 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset + 1;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 1006#L30-5 assume true; 1011#L30-1 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L30-1 1007#L30-2 assume !!(cstrcspn_#t~mem3 != 0);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 995#L32 SUMMARY for call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L32 990#L32-1 cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 976#L33-9 [2018-11-10 07:23:30,302 INFO L795 eck$LassoCheckResult]: Loop: 976#L33-9 assume true; 1003#L33-1 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L33-1 1013#L33-2 cstrcspn_#t~short7 := cstrcspn_#t~mem5 != 0; 988#L33-3 assume cstrcspn_#t~short7; 986#L33-4 SUMMARY for call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L33-4 982#L33-5 cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 975#L33-7 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset + 1;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 976#L33-9 [2018-11-10 07:23:30,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:23:30,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1822686176, now seen corresponding path program 1 times [2018-11-10 07:23:30,303 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:23:30,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:23:30,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:23:30,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:23:30,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:23:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:23:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:23:30,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:23:30,326 INFO L82 PathProgramCache]: Analyzing trace with hash -168195247, now seen corresponding path program 3 times [2018-11-10 07:23:30,326 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:23:30,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:23:30,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:23:30,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:23:30,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:23:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:23:30,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:23:30,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:23:30,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1008039506, now seen corresponding path program 1 times [2018-11-10 07:23:30,335 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:23:30,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:23:30,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:23:30,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:23:30,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:23:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:23:30,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:23:30,463 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2018-11-10 07:23:31,057 WARN L179 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 183 [2018-11-10 07:23:31,867 WARN L179 SmtUtils]: Spent 798.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 127 [2018-11-10 07:23:31,869 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:23:31,869 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:23:31,869 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:23:31,869 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:23:31,869 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:23:31,869 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:23:31,869 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:23:31,869 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:23:31,869 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_true-termination_true-no-overflow.c_Iteration6_Lasso [2018-11-10 07:23:31,870 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:23:31,870 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:23:31,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:23:31,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:23:31,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:23:31,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:23:31,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:23:31,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:23:31,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:23:31,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:23:31,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:23:31,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:23:31,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:23:31,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:23:31,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:23:31,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:23:32,022 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 07:23:32,628 WARN L179 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 121 [2018-11-10 07:23:32,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:23:32,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:23:32,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:23:32,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:23:33,499 WARN L179 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2018-11-10 07:23:33,600 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-11-10 07:23:33,606 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:23:33,606 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:23:33,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-10 07:23:33,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:23:33,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:23:33,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:23:33,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:23:33,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:23:33,610 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:23:33,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:23:33,611 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:23:33,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-10 07:23:33,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:23:33,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:23:33,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:23:33,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:23:33,612 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:23:33,612 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:23:33,615 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:23:33,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-10 07:23:33,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:23:33,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:23:33,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:23:33,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:23:33,617 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:23:33,617 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:23:33,618 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:23:33,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-10 07:23:33,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:23:33,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:23:33,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:23:33,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:23:33,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:23:33,619 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:23:33,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:23:33,619 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:23:33,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-10 07:23:33,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:23:33,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:23:33,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:23:33,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:23:33,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:23:33,620 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:23:33,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:23:33,620 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:23:33,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:23:33,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:23:33,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:23:33,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:23:33,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:23:33,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:23:33,621 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:23:33,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:23:33,621 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:23:33,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:23:33,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:23:33,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:23:33,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:23:33,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:23:33,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:23:33,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:23:33,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:23:33,622 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:23:33,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-10 07:23:33,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:23:33,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:23:33,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:23:33,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:23:33,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:23:33,623 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:23:33,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:23:33,624 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:23:33,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:23:33,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:23:33,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:23:33,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:23:33,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:23:33,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:23:33,625 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:23:33,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:23:33,625 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:23:33,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-10 07:23:33,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:23:33,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:23:33,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:23:33,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:23:33,627 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:23:33,627 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:23:33,627 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:23:33,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:23:33,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:23:33,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:23:33,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:23:33,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:23:33,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:23:33,629 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:23:33,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:23:33,629 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:23:33,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-10 07:23:33,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:23:33,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:23:33,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:23:33,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:23:33,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:23:33,630 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:23:33,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:23:33,630 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:23:33,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:23:33,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:23:33,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:23:33,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:23:33,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:23:33,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:23:33,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:23:33,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:23:33,632 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:23:33,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:23:33,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:23:33,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:23:33,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:23:33,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:23:33,633 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:23:33,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:23:33,639 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:23:33,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:23:33,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:23:33,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:23:33,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:23:33,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:23:33,641 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:23:33,641 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:23:33,644 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:23:33,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-10 07:23:33,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:23:33,644 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 07:23:33,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:23:33,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:23:33,645 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 07:23:33,645 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:23:33,648 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:23:33,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:23:33,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:23:33,649 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 07:23:33,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:23:33,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:23:33,651 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 07:23:33,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:23:33,657 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:23:33,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-10 07:23:33,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:23:33,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:23:33,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:23:33,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:23:33,658 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:23:33,658 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:23:33,660 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:23:33,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-10 07:23:33,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:23:33,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:23:33,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:23:33,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:23:33,661 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:23:33,661 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:23:33,663 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:23:33,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-10 07:23:33,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:23:33,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:23:33,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:23:33,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:23:33,664 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:23:33,664 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:23:33,665 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:23:33,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:23:33,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:23:33,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:23:33,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:23:33,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:23:33,668 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:23:33,668 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:23:33,685 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:23:33,708 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 07:23:33,708 INFO L444 ModelExtractionUtils]: 54 out of 61 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 07:23:33,708 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:23:33,709 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 07:23:33,709 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:23:33,709 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_build_nondet_String_~nondetString~0.base)_1, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_build_nondet_String_~nondetString~0.base)_1 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2018-11-10 07:23:33,785 INFO L297 tatePredicateManager]: 24 out of 25 supporting invariants were superfluous and have been removed [2018-11-10 07:23:33,787 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 07:23:33,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:23:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:23:33,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:23:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:23:33,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:23:33,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:23:33,849 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-11-10 07:23:33,849 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 72 transitions. cyclomatic complexity: 11 Second operand 7 states. [2018-11-10 07:23:33,928 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 72 transitions. cyclomatic complexity: 11. Second operand 7 states. Result 96 states and 108 transitions. Complement of second has 10 states. [2018-11-10 07:23:33,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 07:23:33,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 07:23:33,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2018-11-10 07:23:33,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 33 transitions. Stem has 32 letters. Loop has 7 letters. [2018-11-10 07:23:33,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:23:33,929 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 07:23:33,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:23:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:23:33,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:23:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:23:33,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:23:33,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:23:33,987 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2018-11-10 07:23:33,987 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 72 transitions. cyclomatic complexity: 11 Second operand 7 states. [2018-11-10 07:23:34,037 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 72 transitions. cyclomatic complexity: 11. Second operand 7 states. Result 96 states and 108 transitions. Complement of second has 10 states. [2018-11-10 07:23:34,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 07:23:34,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 07:23:34,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2018-11-10 07:23:34,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 33 transitions. Stem has 32 letters. Loop has 7 letters. [2018-11-10 07:23:34,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:23:34,038 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 07:23:34,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:23:34,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:23:34,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:23:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:23:34,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:23:34,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:23:34,099 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-11-10 07:23:34,099 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 72 transitions. cyclomatic complexity: 11 Second operand 7 states. [2018-11-10 07:23:34,155 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 72 transitions. cyclomatic complexity: 11. Second operand 7 states. Result 103 states and 118 transitions. Complement of second has 9 states. [2018-11-10 07:23:34,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 07:23:34,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 07:23:34,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2018-11-10 07:23:34,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 49 transitions. Stem has 32 letters. Loop has 7 letters. [2018-11-10 07:23:34,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:23:34,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 49 transitions. Stem has 39 letters. Loop has 7 letters. [2018-11-10 07:23:34,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:23:34,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 49 transitions. Stem has 32 letters. Loop has 14 letters. [2018-11-10 07:23:34,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:23:34,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 118 transitions. [2018-11-10 07:23:34,160 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:23:34,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 0 states and 0 transitions. [2018-11-10 07:23:34,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 07:23:34,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 07:23:34,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 07:23:34,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:23:34,161 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:23:34,161 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:23:34,161 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:23:34,161 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 07:23:34,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:23:34,161 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:23:34,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 07:23:34,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 07:23:34 BoogieIcfgContainer [2018-11-10 07:23:34,166 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 07:23:34,167 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:23:34,167 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:23:34,167 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:23:34,167 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:22:05" (3/4) ... [2018-11-10 07:23:34,170 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 07:23:34,170 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:23:34,171 INFO L168 Benchmark]: Toolchain (without parser) took 88892.89 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 354.4 MB). Free memory was 960.3 MB in the beginning and 1.2 GB in the end (delta: -224.7 MB). Peak memory consumption was 129.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:23:34,171 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:23:34,171 INFO L168 Benchmark]: CACSL2BoogieTranslator took 145.87 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:23:34,172 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.86 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:23:34,172 INFO L168 Benchmark]: Boogie Preprocessor took 20.93 ms. Allocated memory is still 1.0 GB. Free memory was 946.9 MB in the beginning and 944.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:23:34,173 INFO L168 Benchmark]: RCFGBuilder took 344.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -187.9 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2018-11-10 07:23:34,173 INFO L168 Benchmark]: BuchiAutomizer took 88349.32 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 198.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -52.9 MB). Peak memory consumption was 145.2 MB. Max. memory is 11.5 GB. [2018-11-10 07:23:34,174 INFO L168 Benchmark]: Witness Printer took 3.48 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-11-10 07:23:34,176 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 145.87 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 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 25.86 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.93 ms. Allocated memory is still 1.0 GB. Free memory was 946.9 MB in the beginning and 944.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 344.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -187.9 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 88349.32 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 198.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -52.9 MB). Peak memory consumption was 145.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.48 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.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * 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 #Ultimate.alloc_#res - 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 4 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[#Ultimate.alloc_#res] and consists of 8 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[nondetString] + -1 * s and consists of 7 locations. 3 modules have a trivial ranking function, the largest among these consists of 18 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 88.3s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 78.2s. Construction of modules took 0.2s. Büchi inclusion checks took 9.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 38 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 64 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 221 SDtfs, 417 SDslu, 341 SDs, 0 SdLazy, 386 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital365 mio100 ax100 hnf99 lsp90 ukn90 mio100 lsp28 div115 bol100 ite100 ukn100 eq181 hnf82 smp91 dnf725 smp50 tf100 neg96 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 92ms VariablesStem: 2 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 108 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...