./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b3d67afc-7dbc-4189-829c-85ddb700c97a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b3d67afc-7dbc-4189-829c-85ddb700c97a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b3d67afc-7dbc-4189-829c-85ddb700c97a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b3d67afc-7dbc-4189-829c-85ddb700c97a/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b3d67afc-7dbc-4189-829c-85ddb700c97a/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b3d67afc-7dbc-4189-829c-85ddb700c97a/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 32bit --witnessprinter.graph.data.programhash 022e5e55adeb2213dd3e7a54e30f105429bff667 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 11:18:14,105 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:18:14,106 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:18:14,114 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:18:14,115 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:18:14,115 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:18:14,116 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:18:14,117 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:18:14,119 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:18:14,119 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:18:14,120 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:18:14,120 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:18:14,121 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:18:14,121 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:18:14,122 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:18:14,122 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:18:14,123 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:18:14,124 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:18:14,125 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:18:14,126 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:18:14,127 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:18:14,128 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:18:14,129 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:18:14,129 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:18:14,130 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:18:14,130 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:18:14,131 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:18:14,131 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:18:14,132 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:18:14,133 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:18:14,133 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:18:14,133 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:18:14,133 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:18:14,134 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:18:14,134 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:18:14,135 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:18:14,135 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b3d67afc-7dbc-4189-829c-85ddb700c97a/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 11:18:14,146 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:18:14,146 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:18:14,147 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:18:14,147 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:18:14,147 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:18:14,147 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 11:18:14,147 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 11:18:14,147 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 11:18:14,147 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 11:18:14,147 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 11:18:14,147 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 11:18:14,147 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:18:14,147 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:18:14,148 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 11:18:14,148 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:18:14,148 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:18:14,148 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:18:14,148 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 11:18:14,148 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 11:18:14,148 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 11:18:14,148 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:18:14,148 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:18:14,148 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 11:18:14,148 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:18:14,148 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 11:18:14,148 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:18:14,149 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:18:14,149 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 11:18:14,149 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:18:14,149 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:18:14,149 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 11:18:14,149 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 11:18:14,149 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_b3d67afc-7dbc-4189-829c-85ddb700c97a/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 022e5e55adeb2213dd3e7a54e30f105429bff667 [2018-11-28 11:18:14,172 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:18:14,181 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:18:14,184 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:18:14,185 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:18:14,185 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:18:14,186 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b3d67afc-7dbc-4189-829c-85ddb700c97a/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-11-28 11:18:14,231 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b3d67afc-7dbc-4189-829c-85ddb700c97a/bin-2019/uautomizer/data/0e9c081ce/89647c8efd4e480eab016f3f10e19eda/FLAG2195d7e3f [2018-11-28 11:18:14,628 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:18:14,628 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b3d67afc-7dbc-4189-829c-85ddb700c97a/sv-benchmarks/c/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-11-28 11:18:14,639 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b3d67afc-7dbc-4189-829c-85ddb700c97a/bin-2019/uautomizer/data/0e9c081ce/89647c8efd4e480eab016f3f10e19eda/FLAG2195d7e3f [2018-11-28 11:18:14,652 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b3d67afc-7dbc-4189-829c-85ddb700c97a/bin-2019/uautomizer/data/0e9c081ce/89647c8efd4e480eab016f3f10e19eda [2018-11-28 11:18:14,655 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:18:14,656 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:18:14,657 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:18:14,657 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:18:14,661 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:18:14,661 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:18:14" (1/1) ... [2018-11-28 11:18:14,664 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f49e46b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:14, skipping insertion in model container [2018-11-28 11:18:14,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:18:14" (1/1) ... [2018-11-28 11:18:14,669 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:18:14,696 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:18:14,909 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:18:14,918 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:18:15,000 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:18:15,026 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:18:15,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:15 WrapperNode [2018-11-28 11:18:15,026 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:18:15,027 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:18:15,027 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:18:15,027 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:18:15,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:15" (1/1) ... [2018-11-28 11:18:15,043 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:15" (1/1) ... [2018-11-28 11:18:15,061 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:18:15,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:18:15,061 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:18:15,061 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:18:15,067 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:15" (1/1) ... [2018-11-28 11:18:15,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:15" (1/1) ... [2018-11-28 11:18:15,069 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:15" (1/1) ... [2018-11-28 11:18:15,070 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:15" (1/1) ... [2018-11-28 11:18:15,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:15" (1/1) ... [2018-11-28 11:18:15,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:15" (1/1) ... [2018-11-28 11:18:15,078 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:15" (1/1) ... [2018-11-28 11:18:15,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:18:15,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:18:15,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:18:15,080 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:18:15,081 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3d67afc-7dbc-4189-829c-85ddb700c97a/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-28 11:18:15,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:18:15,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 11:18:15,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 11:18:15,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:18:15,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:18:15,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:18:15,329 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:18:15,329 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 11:18:15,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:18:15 BoogieIcfgContainer [2018-11-28 11:18:15,330 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:18:15,330 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 11:18:15,331 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 11:18:15,334 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 11:18:15,334 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:18:15,334 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:18:14" (1/3) ... [2018-11-28 11:18:15,335 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52d68862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:18:15, skipping insertion in model container [2018-11-28 11:18:15,335 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:18:15,336 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:15" (2/3) ... [2018-11-28 11:18:15,336 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52d68862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:18:15, skipping insertion in model container [2018-11-28 11:18:15,336 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:18:15,336 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:18:15" (3/3) ... [2018-11-28 11:18:15,337 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-11-28 11:18:15,384 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:18:15,385 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 11:18:15,385 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 11:18:15,385 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 11:18:15,385 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:18:15,385 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:18:15,385 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 11:18:15,385 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:18:15,385 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 11:18:15,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 11:18:15,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 11:18:15,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:18:15,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:18:15,423 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 11:18:15,424 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:18:15,424 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 11:18:15,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 11:18:15,425 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 11:18:15,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:18:15,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:18:15,426 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 11:18:15,426 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:18:15,433 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 3#L558true assume !(main_~length1~0 < 1); 6#L558-2true assume !(main_~length2~0 < 1); 19#L561-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.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; 15#L545-4true [2018-11-28 11:18:15,434 INFO L796 eck$LassoCheckResult]: Loop: 15#L545-4true call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 8#L545-1true assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 9#L548-5true assume !true; 12#L548-6true call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 18#L550true assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 13#L545-3true 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, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 15#L545-4true [2018-11-28 11:18:15,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:15,438 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-28 11:18:15,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:18:15,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:18:15,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:15,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:18:15,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:18:15,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:18:15,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:15,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2018-11-28 11:18:15,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:18:15,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:18:15,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:15,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:18:15,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:18:15,579 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-28 11:18:15,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:18:15,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 11:18:15,584 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:18:15,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 11:18:15,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 11:18:15,596 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-28 11:18:15,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:18:15,602 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-11-28 11:18:15,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 11:18:15,604 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-11-28 11:18:15,605 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 11:18:15,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2018-11-28 11:18:15,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 11:18:15,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 11:18:15,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-11-28 11:18:15,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:18:15,610 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-28 11:18:15,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-11-28 11:18:15,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-28 11:18:15,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 11:18:15,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-11-28 11:18:15,630 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-28 11:18:15,630 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-28 11:18:15,630 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 11:18:15,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-11-28 11:18:15,631 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 11:18:15,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:18:15,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:18:15,632 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 11:18:15,632 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:18:15,632 INFO L794 eck$LassoCheckResult]: Stem: 56#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 52#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 44#L558 assume !(main_~length1~0 < 1); 45#L558-2 assume !(main_~length2~0 < 1); 48#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.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; 55#L545-4 [2018-11-28 11:18:15,632 INFO L796 eck$LassoCheckResult]: Loop: 55#L545-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 51#L545-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 50#L548-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 46#L548-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 47#L548-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6; 49#L548-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 53#L550 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 54#L545-3 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, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 55#L545-4 [2018-11-28 11:18:15,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:15,633 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-28 11:18:15,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:18:15,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:18:15,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:15,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:18:15,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:18:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:18:15,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:15,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2018-11-28 11:18:15,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:18:15,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:18:15,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:15,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:18:15,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:18:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:18:15,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:15,690 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2018-11-28 11:18:15,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:18:15,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:18:15,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:15,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:18:15,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:18:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:18:15,929 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2018-11-28 11:18:16,112 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-11-28 11:18:16,278 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2018-11-28 11:18:16,356 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:18:16,357 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:18:16,358 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:18:16,358 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:18:16,358 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:18:16,358 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:18:16,358 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:18:16,358 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:18:16,359 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-28 11:18:16,359 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:18:16,359 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:18:16,378 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-28 11:18:16,382 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-28 11:18:16,384 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-28 11:18:16,387 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-28 11:18:16,391 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-28 11:18:16,685 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2018-11-28 11:18:16,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:18:16,688 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-28 11:18:16,694 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-28 11:18:16,696 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-28 11:18:16,697 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-28 11:18:16,698 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-28 11:18:16,699 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-28 11:18:16,701 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-28 11:18:16,702 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-28 11:18:16,704 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-28 11:18:16,707 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-28 11:18:16,709 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-28 11:18:16,711 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-28 11:18:17,116 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2018-11-28 11:18:17,267 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:18:17,272 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:18:17,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 11:18:17,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:17,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:18:17,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:17,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:17,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:17,279 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:18:17,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:18:17,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:17,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 11:18:17,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:17,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:18:17,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:17,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:17,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:17,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:18:17,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:18:17,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:17,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 11:18:17,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:17,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:17,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:17,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:17,286 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:18:17,286 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:18:17,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:17,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:18:17,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:17,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:18:17,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:17,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:17,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:17,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:18:17,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:18:17,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:17,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 11:18:17,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:17,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:17,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:17,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:17,294 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:18:17,294 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:18:17,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:17,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-28 11:18:17,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:17,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:17,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:17,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:17,303 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:18:17,303 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:18:17,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:17,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 11:18:17,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:17,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:18:17,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:17,315 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-28 11:18:17,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:17,319 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:18:17,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:18:17,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:17,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 11:18:17,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:17,336 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:18:17,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:17,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:17,341 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:18:17,341 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:18:17,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:17,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 11:18:17,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:17,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:17,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:17,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:17,360 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:18:17,361 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:18:17,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:17,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 11:18:17,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:17,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:17,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:17,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:17,374 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:18:17,374 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:18:17,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:17,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 11:18:17,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:17,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:18:17,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:17,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:17,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:17,379 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:18:17,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:18:17,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:17,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 11:18:17,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:17,381 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:18:17,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:17,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:17,384 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:18:17,384 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:18:17,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:17,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 11:18:17,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:17,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:17,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:17,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:17,396 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:18:17,396 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:18:17,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:17,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 11:18:17,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:17,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:17,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:17,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:17,403 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:18:17,403 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:18:17,420 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:18:17,436 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 11:18:17,436 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 11:18:17,438 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:18:17,440 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:18:17,440 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:18:17,441 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1, ULTIMATE.start_cstrcspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1 - 1*ULTIMATE.start_cstrcspn_~sc1~0.offset Supporting invariants [] [2018-11-28 11:18:17,478 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-28 11:18:17,485 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 11:18:17,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:18:17,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:18:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:18:17,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:18:17,588 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-28 11:18:17,591 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-28 11:18:17,592 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 11:18:17,654 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2018-11-28 11:18:17,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 11:18:17,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 11:18:17,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-11-28 11:18:17,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-28 11:18:17,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:18:17,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2018-11-28 11:18:17,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:18:17,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2018-11-28 11:18:17,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:18:17,659 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-11-28 11:18:17,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 11:18:17,660 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2018-11-28 11:18:17,660 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 11:18:17,660 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 11:18:17,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-11-28 11:18:17,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:18:17,660 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-28 11:18:17,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-11-28 11:18:17,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-28 11:18:17,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-28 11:18:17,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-11-28 11:18:17,662 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-28 11:18:17,662 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-28 11:18:17,662 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 11:18:17,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-11-28 11:18:17,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 11:18:17,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:18:17,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:18:17,663 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:18:17,664 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 11:18:17,664 INFO L794 eck$LassoCheckResult]: Stem: 194#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 190#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 178#L558 assume !(main_~length1~0 < 1); 179#L558-2 assume !(main_~length2~0 < 1); 184#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.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; 195#L545-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 188#L545-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 185#L548-5 [2018-11-28 11:18:17,664 INFO L796 eck$LassoCheckResult]: Loop: 185#L548-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 180#L548-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 181#L548-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;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, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 185#L548-5 [2018-11-28 11:18:17,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:17,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-11-28 11:18:17,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:18:17,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:18:17,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:17,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:18:17,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:18:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:18:17,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:17,685 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2018-11-28 11:18:17,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:18:17,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:18:17,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:17,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:18:17,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:18:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:18:17,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:17,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2018-11-28 11:18:17,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:18:17,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:18:17,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:17,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:18:17,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:18:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:18:18,071 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 97 [2018-11-28 11:18:18,149 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:18:18,149 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:18:18,149 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:18:18,149 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:18:18,149 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:18:18,149 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:18:18,149 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:18:18,149 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:18:18,150 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-28 11:18:18,150 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:18:18,150 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:18:18,153 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-28 11:18:18,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:18:18,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:18:18,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:18:18,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:18:18,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:18:18,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:18:18,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:18:18,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:18:18,193 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-28 11:18:18,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:18:18,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:18:18,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:18:18,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:18:18,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:18:18,200 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-28 11:18:18,373 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2018-11-28 11:18:18,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:18:18,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:18:18,873 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-11-28 11:18:18,917 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:18:18,917 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:18:18,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 11:18:18,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:18,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:18:18,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:18,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:18,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:18,919 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:18:18,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:18:18,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:18,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:18:18,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:18,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:18:18,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:18,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:18,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:18,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:18:18,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:18:18,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:18,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 11:18:18,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:18,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:18:18,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:18,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:18,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:18,925 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:18:18,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:18:18,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:18,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:18:18,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:18,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:18:18,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:18,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:18,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:18,927 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:18:18,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:18:18,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:18,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:18:18,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:18,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:18:18,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:18,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:18,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:18,929 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:18:18,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:18:18,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:18,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:18:18,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:18,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:18,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:18,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:18,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:18:18,932 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:18:18,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:18,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:18:18,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:18,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:18:18,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:18,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:18,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:18,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:18:18,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:18:18,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:18,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:18:18,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:18,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:18,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:18,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:18,937 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:18:18,938 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:18:18,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:18,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:18:18,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:18,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:18:18,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:18,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:18,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:18,940 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:18:18,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:18:18,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:18,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:18:18,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:18,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:18:18,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:18,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:18,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:18,942 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:18:18,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:18:18,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:18,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:18:18,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:18,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:18:18,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:18,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:18,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:18,944 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:18:18,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:18:18,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:18,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 11:18:18,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:18,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:18:18,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:18,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:18,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:18,946 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:18:18,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:18:18,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:18,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:18:18,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:18,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:18:18,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:18,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:18,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:18,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:18:18,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:18:18,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:18,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 11:18:18,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:18,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:18:18,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:18,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:18,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:18,950 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:18:18,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:18:18,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:18,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:18:18,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:18,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:18:18,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:18,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:18,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:18,952 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:18:18,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:18:18,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:18,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:18:18,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:18,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:18,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:18,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:18,955 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:18:18,955 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:18:18,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:18,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 11:18:18,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:18,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:18,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:18,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:18,962 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:18:18,962 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:18:18,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:18,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 11:18:18,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:18,965 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:18:18,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:18,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:18,967 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:18:18,967 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:18:18,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:18,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:18:18,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:18,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:18,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:18,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:18,976 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:18:18,976 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:18:18,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:18,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:18:18,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:18,978 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:18:18,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:18,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:18,980 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:18:18,980 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:18:18,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:18,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:18:18,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:18,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:18,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:18,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:18,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:18:18,989 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:18:18,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:18,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 11:18:18,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:18,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:18,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:18,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:18,993 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:18:18,993 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:18:18,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:18,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 11:18:18,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:18,995 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:18:18,995 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-28 11:18:18,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:19,019 INFO L402 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2018-11-28 11:18:19,020 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-28 11:18:19,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:19,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 11:18:19,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:19,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:19,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:19,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:19,085 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:18:19,085 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:18:19,098 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:18:19,112 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 11:18:19,113 INFO L444 ModelExtractionUtils]: 35 out of 40 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 11:18:19,113 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:18:19,114 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:18:19,114 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:18:19,114 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2018-11-28 11:18:19,158 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-11-28 11:18:19,159 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 11:18:19,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:18:19,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:18:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:18:19,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:18:19,211 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-28 11:18:19,212 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-28 11:18:19,212 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-28 11:18:19,249 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 57 transitions. Complement of second has 6 states. [2018-11-28 11:18:19,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 11:18:19,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:18:19,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-28 11:18:19,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-28 11:18:19,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:18:19,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-28 11:18:19,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:18:19,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-28 11:18:19,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:18:19,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-11-28 11:18:19,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 11:18:19,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2018-11-28 11:18:19,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 11:18:19,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 11:18:19,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-11-28 11:18:19,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:18:19,254 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-11-28 11:18:19,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-11-28 11:18:19,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-11-28 11:18:19,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-28 11:18:19,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-11-28 11:18:19,257 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-28 11:18:19,257 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-28 11:18:19,257 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 11:18:19,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2018-11-28 11:18:19,257 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 11:18:19,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:18:19,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:18:19,258 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:18:19,258 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 11:18:19,258 INFO L794 eck$LassoCheckResult]: Stem: 375#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 371#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 358#L558 assume !(main_~length1~0 < 1); 359#L558-2 assume !(main_~length2~0 < 1); 364#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.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; 376#L545-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 377#L545-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 379#L548-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 380#L548-1 assume !cstrcspn_#t~short7; 366#L548-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6; 367#L548-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 372#L550 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 373#L545-3 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, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 374#L545-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 368#L545-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 365#L548-5 [2018-11-28 11:18:19,258 INFO L796 eck$LassoCheckResult]: Loop: 365#L548-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 360#L548-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 361#L548-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;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, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 365#L548-5 [2018-11-28 11:18:19,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:19,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2018-11-28 11:18:19,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:18:19,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:18:19,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:19,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:18:19,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:19,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:18:19,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:18:19,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:19,281 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2018-11-28 11:18:19,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:18:19,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:18:19,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:19,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:18:19,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:19,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:18:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:18:19,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:19,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2018-11-28 11:18:19,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:18:19,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:18:19,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:19,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:18:19,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:18:19,376 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:18:19,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:18:19,376 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3d67afc-7dbc-4189-829c-85ddb700c97a/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-28 11:18:19,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:18:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:18:19,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:18:19,461 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2018-11-28 11:18:19,464 INFO L478 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-28 11:18:19,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:18:19,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2018-11-28 11:18:19,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 24 [2018-11-28 11:18:19,503 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:18:19,525 INFO L478 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 22 treesize of output 21 [2018-11-28 11:18:19,525 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:18:19,536 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:18:19,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:18:19,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-11-28 11:18:19,550 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:36, output treesize:21 [2018-11-28 11:18:57,235 WARN L180 SmtUtils]: Spent 1.57 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-28 11:19:22,826 WARN L180 SmtUtils]: Spent 1.57 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-28 11:19:37,877 WARN L180 SmtUtils]: Spent 1.47 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-28 11:19:37,883 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:37,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:19:37,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-11-28 11:19:38,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 11:19:38,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=116, Unknown=7, NotChecked=0, Total=156 [2018-11-28 11:19:38,038 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 13 states. [2018-11-28 11:19:40,710 WARN L180 SmtUtils]: Spent 2.55 s on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2018-11-28 11:19:43,740 WARN L180 SmtUtils]: Spent 3.02 s on a formula simplification. DAG size of input: 26 DAG size of output: 19 [2018-11-28 11:19:43,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:43,783 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2018-11-28 11:19:43,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:19:43,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 72 transitions. [2018-11-28 11:19:43,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 11:19:43,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 43 states and 53 transitions. [2018-11-28 11:19:43,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-28 11:19:43,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 11:19:43,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2018-11-28 11:19:43,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:19:43,786 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2018-11-28 11:19:43,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2018-11-28 11:19:43,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-11-28 11:19:43,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 11:19:43,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2018-11-28 11:19:43,789 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-11-28 11:19:43,789 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-11-28 11:19:43,789 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 11:19:43,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2018-11-28 11:19:43,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 11:19:43,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:19:43,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:19:43,790 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:43,790 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 11:19:43,790 INFO L794 eck$LassoCheckResult]: Stem: 539#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 534#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 519#L558 assume !(main_~length1~0 < 1); 520#L558-2 assume !(main_~length2~0 < 1); 525#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.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; 540#L545-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 541#L545-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 543#L548-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 523#L548-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 524#L548-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6; 535#L548-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 536#L550 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 537#L545-3 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, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 538#L545-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 529#L545-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 526#L548-5 [2018-11-28 11:19:43,790 INFO L796 eck$LassoCheckResult]: Loop: 526#L548-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 521#L548-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 522#L548-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;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, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 526#L548-5 [2018-11-28 11:19:43,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:43,790 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2018-11-28 11:19:43,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:43,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:43,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:43,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:43,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:19:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:19:43,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:43,809 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2018-11-28 11:19:43,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:43,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:43,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:43,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:19:43,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:19:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:19:43,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:43,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2018-11-28 11:19:43,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:43,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:43,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:43,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:19:43,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:19:43,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:19:44,278 WARN L180 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 134 [2018-11-28 11:19:44,981 WARN L180 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 106 [2018-11-28 11:19:44,983 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:19:44,983 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:19:44,983 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:19:44,983 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:19:44,983 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:19:44,983 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:19:44,984 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:19:44,984 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:19:44,984 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-11-28 11:19:44,984 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:19:44,984 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:19:44,994 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-28 11:19:45,011 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-28 11:19:45,013 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-28 11:19:45,015 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-28 11:19:45,016 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-28 11:19:45,017 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-28 11:19:45,018 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-28 11:19:45,020 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-28 11:19:45,021 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-28 11:19:45,022 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-28 11:19:45,023 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-28 11:19:45,024 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-28 11:19:45,179 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-28 11:19:45,541 WARN L180 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 97 [2018-11-28 11:19:45,626 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-28 11:19:45,628 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-28 11:19:45,628 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-28 11:19:45,629 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-28 11:19:45,630 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-28 11:19:45,631 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-28 11:19:46,101 WARN L180 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 120 [2018-11-28 11:19:46,175 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-28 11:19:50,238 WARN L180 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 176 DAG size of output: 125 [2018-11-28 11:19:50,752 WARN L180 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2018-11-28 11:19:50,760 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:19:50,761 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:19:50,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 11:19:50,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:19:50,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:19:50,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:19:50,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:19:50,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:19:50,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:19:50,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:19:50,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:19:50,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:19:50,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:19:50,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:19:50,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:19:50,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:19:50,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:19:50,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:19:50,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:19:50,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:19:50,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 11:19:50,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:19:50,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:19:50,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:19:50,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:19:50,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:19:50,769 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:19:50,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:19:50,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:19:50,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:19:50,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:19:50,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:19:50,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:19:50,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:19:50,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:19:50,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:19:50,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:19:50,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:19:50,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:19:50,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:19:50,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:19:50,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:19:50,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:19:50,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:19:50,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:19:50,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:19:50,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:19:50,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:19:50,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:19:50,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:19:50,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:19:50,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:19:50,774 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:19:50,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:19:50,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:19:50,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 11:19:50,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:19:50,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:19:50,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:19:50,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:19:50,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:19:50,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:19:50,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:19:50,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:19:50,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:19:50,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:19:50,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:19:50,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:19:50,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:19:50,777 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:19:50,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:19:50,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:19:50,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 11:19:50,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:19:50,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:19:50,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:19:50,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:19:50,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:19:50,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:19:50,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:19:50,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:19:50,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:19:50,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:19:50,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:19:50,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:19:50,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:19:50,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:19:50,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:19:50,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:19:50,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:19:50,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 11:19:50,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:19:50,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:19:50,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:19:50,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:19:50,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:19:50,782 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:19:50,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:19:50,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:19:50,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 11:19:50,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:19:50,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:19:50,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:19:50,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:19:50,784 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:19:50,784 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:19:50,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:19:50,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 11:19:50,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:19:50,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:19:50,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:19:50,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:19:50,786 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:19:50,786 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:19:50,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:19:50,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 11:19:50,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:19:50,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:19:50,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:19:50,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:19:50,788 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:19:50,788 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:19:50,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:19:50,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 11:19:50,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:19:50,790 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:19:50,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:19:50,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:19:50,791 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:19:50,791 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:19:50,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:19:50,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 11:19:50,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:19:50,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:19:50,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:19:50,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:19:50,797 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:19:50,797 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:19:50,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:19:50,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:19:50,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:19:50,799 INFO L205 nArgumentSynthesizer]: 16 stem disjuncts [2018-11-28 11:19:50,799 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-28 11:19:50,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:19:50,934 INFO L402 nArgumentSynthesizer]: We have 276 Motzkin's Theorem applications. [2018-11-28 11:19:50,935 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-28 11:19:53,425 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:19:55,392 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-28 11:19:55,392 INFO L444 ModelExtractionUtils]: 365 out of 378 variables were initially zero. Simplification set additionally 10 variables to zero. [2018-11-28 11:19:55,393 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:19:55,396 INFO L440 nArgumentSynthesizer]: Removed 12 redundant supporting invariants from a total of 12. [2018-11-28 11:19:55,396 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:19:55,396 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3) = -1*ULTIMATE.start_cstrcspn_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3 Supporting invariants [] [2018-11-28 11:19:55,493 INFO L297 tatePredicateManager]: 25 out of 26 supporting invariants were superfluous and have been removed [2018-11-28 11:19:55,495 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 11:19:55,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:55,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:19:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:55,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:19:55,552 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-28 11:19:55,553 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-28 11:19:55,553 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-28 11:19:55,585 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 6 states. [2018-11-28 11:19:55,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 11:19:55,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:19:55,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-28 11:19:55,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-28 11:19:55,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:19:55,586 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:19:55,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:55,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:19:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:55,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:19:55,648 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-28 11:19:55,648 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-28 11:19:55,648 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-28 11:19:55,678 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 6 states. [2018-11-28 11:19:55,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 11:19:55,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:19:55,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-28 11:19:55,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-28 11:19:55,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:19:55,679 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:19:55,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:55,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:19:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:55,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:19:55,728 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-28 11:19:55,728 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-28 11:19:55,728 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-28 11:19:55,757 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 45 states and 60 transitions. Complement of second has 5 states. [2018-11-28 11:19:55,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 11:19:55,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:19:55,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-28 11:19:55,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-28 11:19:55,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:19:55,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-28 11:19:55,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:19:55,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-28 11:19:55,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:19:55,759 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. [2018-11-28 11:19:55,761 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:19:55,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2018-11-28 11:19:55,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 11:19:55,761 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 11:19:55,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 11:19:55,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:19:55,761 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:19:55,761 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:19:55,761 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:19:55,762 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 11:19:55,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 11:19:55,762 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:19:55,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 11:19:55,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:19:55 BoogieIcfgContainer [2018-11-28 11:19:55,767 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 11:19:55,767 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:19:55,767 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:19:55,767 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:19:55,768 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:18:15" (3/4) ... [2018-11-28 11:19:55,770 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 11:19:55,770 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:19:55,771 INFO L168 Benchmark]: Toolchain (without parser) took 101114.99 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 567.3 MB). Free memory was 949.5 MB in the beginning and 1.3 GB in the end (delta: -381.8 MB). Peak memory consumption was 185.5 MB. Max. memory is 11.5 GB. [2018-11-28 11:19:55,771 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:19:55,771 INFO L168 Benchmark]: CACSL2BoogieTranslator took 369.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -194.1 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-11-28 11:19:55,772 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-28 11:19:55,772 INFO L168 Benchmark]: Boogie Preprocessor took 19.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:19:55,773 INFO L168 Benchmark]: RCFGBuilder took 249.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-11-28 11:19:55,773 INFO L168 Benchmark]: BuchiAutomizer took 100436.30 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 411.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -219.2 MB). Peak memory consumption was 192.3 MB. Max. memory is 11.5 GB. [2018-11-28 11:19:55,774 INFO L168 Benchmark]: Witness Printer took 3.09 ms. Allocated memory is still 1.6 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:19:55,776 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 369.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -194.1 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 249.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 100436.30 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 411.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -219.2 MB). Peak memory consumption was 192.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.09 ms. Allocated memory is still 1.6 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * s and consists of 4 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 100.3s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 93.9s. Construction of modules took 0.1s. Büchi inclusion checks took 6.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 102 SDtfs, 151 SDslu, 110 SDs, 0 SdLazy, 154 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital366 mio100 ax100 hnf99 lsp92 ukn71 mio100 lsp69 div125 bol100 ite100 ukn100 eq169 hnf83 smp79 dnf1846 smp25 tf100 neg96 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 4597ms VariablesStem: 30 VariablesLoop: 19 DisjunctsStem: 16 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 276 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...