./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_819116ae-e266-4607-94e3-7ed7a0f41cea/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_819116ae-e266-4607-94e3-7ed7a0f41cea/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_819116ae-e266-4607-94e3-7ed7a0f41cea/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_819116ae-e266-4607-94e3-7ed7a0f41cea/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_819116ae-e266-4607-94e3-7ed7a0f41cea/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_819116ae-e266-4607-94e3-7ed7a0f41cea/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 7d00aad8dfdafc20547a229a92ab2c2bdb101f8c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:08:24,130 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:08:24,132 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:08:24,142 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:08:24,143 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:08:24,143 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:08:24,145 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:08:24,146 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:08:24,148 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:08:24,149 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:08:24,150 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:08:24,150 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:08:24,151 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:08:24,152 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:08:24,153 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:08:24,154 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:08:24,155 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:08:24,157 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:08:24,158 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:08:24,160 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:08:24,161 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:08:24,162 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:08:24,165 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:08:24,165 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:08:24,165 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:08:24,166 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:08:24,167 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:08:24,168 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:08:24,169 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:08:24,170 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:08:24,170 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:08:24,171 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:08:24,171 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:08:24,171 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:08:24,173 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:08:24,173 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:08:24,174 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_819116ae-e266-4607-94e3-7ed7a0f41cea/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-10-27 06:08:24,192 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:08:24,194 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:08:24,196 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:08:24,197 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:08:24,197 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:08:24,198 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:08:24,198 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:08:24,199 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:08:24,199 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:08:24,199 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:08:24,199 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:08:24,200 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:08:24,200 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 06:08:24,200 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:08:24,200 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:08:24,201 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 06:08:24,201 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:08:24,201 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:08:24,201 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:08:24,201 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:08:24,201 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 06:08:24,202 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:08:24,202 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:08:24,202 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:08:24,202 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:08:24,202 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:08:24,202 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:08:24,202 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:08:24,203 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:08:24,203 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:08:24,204 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:08:24,208 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_819116ae-e266-4607-94e3-7ed7a0f41cea/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 -> 7d00aad8dfdafc20547a229a92ab2c2bdb101f8c [2018-10-27 06:08:24,263 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:08:24,274 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:08:24,278 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:08:24,279 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:08:24,279 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:08:24,281 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_819116ae-e266-4607-94e3-7ed7a0f41cea/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-10-27 06:08:24,335 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_819116ae-e266-4607-94e3-7ed7a0f41cea/bin-2019/uautomizer/data/30dc94dc3/0af8ffcd580e46c3bf032ec7aabca986/FLAG5b81857c8 [2018-10-27 06:08:24,783 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:08:24,783 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_819116ae-e266-4607-94e3-7ed7a0f41cea/sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-10-27 06:08:24,796 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_819116ae-e266-4607-94e3-7ed7a0f41cea/bin-2019/uautomizer/data/30dc94dc3/0af8ffcd580e46c3bf032ec7aabca986/FLAG5b81857c8 [2018-10-27 06:08:24,809 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_819116ae-e266-4607-94e3-7ed7a0f41cea/bin-2019/uautomizer/data/30dc94dc3/0af8ffcd580e46c3bf032ec7aabca986 [2018-10-27 06:08:24,816 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:08:24,818 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:08:24,818 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:08:24,819 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:08:24,823 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:08:24,824 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:08:24" (1/1) ... [2018-10-27 06:08:24,827 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3005e31a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:24, skipping insertion in model container [2018-10-27 06:08:24,827 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:08:24" (1/1) ... [2018-10-27 06:08:24,837 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:08:24,875 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:08:25,141 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:08:25,151 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:08:25,193 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:08:25,236 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:08:25,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:25 WrapperNode [2018-10-27 06:08:25,237 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:08:25,238 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:08:25,238 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:08:25,238 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:08:25,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:25" (1/1) ... [2018-10-27 06:08:25,262 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:25" (1/1) ... [2018-10-27 06:08:25,359 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:08:25,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:08:25,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:08:25,360 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:08:25,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:25" (1/1) ... [2018-10-27 06:08:25,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:25" (1/1) ... [2018-10-27 06:08:25,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:25" (1/1) ... [2018-10-27 06:08:25,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:25" (1/1) ... [2018-10-27 06:08:25,379 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:25" (1/1) ... [2018-10-27 06:08:25,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:25" (1/1) ... [2018-10-27 06:08:25,385 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:25" (1/1) ... [2018-10-27 06:08:25,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:08:25,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:08:25,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:08:25,388 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:08:25,389 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_819116ae-e266-4607-94e3-7ed7a0f41cea/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-10-27 06:08:25,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:08:25,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:08:25,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:08:25,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:08:26,064 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:08:26,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:26 BoogieIcfgContainer [2018-10-27 06:08:26,065 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:08:26,066 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:08:26,066 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:08:26,070 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:08:26,070 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:26,071 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:08:24" (1/3) ... [2018-10-27 06:08:26,072 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7cb0c46c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:08:26, skipping insertion in model container [2018-10-27 06:08:26,072 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:26,072 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:25" (2/3) ... [2018-10-27 06:08:26,073 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7cb0c46c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:08:26, skipping insertion in model container [2018-10-27 06:08:26,073 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:26,073 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:26" (3/3) ... [2018-10-27 06:08:26,075 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-10-27 06:08:26,131 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:08:26,132 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:08:26,132 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:08:26,132 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:08:26,133 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:08:26,133 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:08:26,133 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:08:26,133 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:08:26,133 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:08:26,149 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2018-10-27 06:08:26,173 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-10-27 06:08:26,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:26,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:26,180 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:26,181 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:08:26,181 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:08:26,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2018-10-27 06:08:26,183 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-10-27 06:08:26,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:26,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:26,184 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:26,184 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:08:26,193 INFO L793 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 13#L563true assume !(main_~length~0 < 1); 17#L563-2true assume !(main_~n~1 < 1); 9#L566-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~1 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset; 28#L571true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1) * 1, 1); srcloc: L571 29#L571-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1) * 1, 1); srcloc: L571-1 15#L572true assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 5#L546true assume cstrlcpy_~n~0 % 4294967296 != 0; 23#L547-4true [2018-10-27 06:08:26,193 INFO L795 eck$LassoCheckResult]: Loop: 23#L547-4true assume true; 20#L547-1true cstrlcpy_#t~pre2 := cstrlcpy_~n~0 - 1;cstrlcpy_~n~0 := cstrlcpy_~n~0 - 1; 21#L547-2true assume !!(cstrlcpy_#t~pre2 % 4294967296 != 0);havoc cstrlcpy_#t~pre2;cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset := cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset + 1;cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset + 1; 3#L548true SUMMARY for call cstrlcpy_#t~mem5 := read~int(cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, 1); srcloc: L548 4#L548-1true SUMMARY for call write~int(cstrlcpy_#t~mem5, cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, 1); srcloc: L548-1 6#L548-2true assume !(cstrlcpy_#t~mem5 == 0);havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset;havoc cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset;havoc cstrlcpy_#t~mem5; 23#L547-4true [2018-10-27 06:08:26,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:26,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1298223690, now seen corresponding path program 1 times [2018-10-27 06:08:26,201 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:26,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:26,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:26,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:26,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:26,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:26,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1629153641, now seen corresponding path program 1 times [2018-10-27 06:08:26,357 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:26,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:26,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:26,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:26,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:26,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:26,403 INFO L82 PathProgramCache]: Analyzing trace with hash 912105714, now seen corresponding path program 1 times [2018-10-27 06:08:26,403 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:26,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:26,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:26,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:26,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:26,895 WARN L179 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-10-27 06:08:27,779 WARN L179 SmtUtils]: Spent 805.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 106 [2018-10-27 06:08:27,953 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-10-27 06:08:27,967 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:27,969 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:27,969 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:27,969 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:27,969 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:27,970 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:27,970 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:27,970 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:27,970 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-10-27 06:08:27,970 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:27,971 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:27,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:28,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:28,657 WARN L179 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 105 [2018-10-27 06:08:28,839 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2018-10-27 06:08:28,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:28,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:28,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:28,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:28,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:28,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:28,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:28,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:28,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:28,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:28,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:28,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:28,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:28,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:28,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:29,264 WARN L179 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2018-10-27 06:08:29,473 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-10-27 06:08:29,869 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:29,874 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:29,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:29,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:29,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:29,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:29,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:29,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:29,880 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:29,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:29,882 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:29,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:29,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:29,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:29,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:29,884 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:08:29,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:29,885 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:08:29,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:29,891 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:29,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:29,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:29,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:29,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:29,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:29,899 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:29,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:29,925 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:29,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:29,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:29,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:29,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:29,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:29,930 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:29,931 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:29,936 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:29,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-10-27 06:08:29,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:29,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:29,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:29,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:29,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:29,938 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:29,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:29,939 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:29,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:29,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:29,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:29,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:29,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:29,945 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:29,945 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:29,952 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:29,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:29,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:29,953 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:29,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:29,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:29,960 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:29,960 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:29,981 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:29,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:29,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:29,983 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:29,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:29,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:29,988 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:29,989 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:30,006 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:30,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:30,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:30,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:30,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:30,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:30,010 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:30,010 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:30,013 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:30,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:30,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:30,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:30,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:30,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:30,027 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:30,027 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:30,128 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:30,197 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-10-27 06:08:30,197 INFO L444 ModelExtractionUtils]: 57 out of 67 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-10-27 06:08:30,199 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:30,201 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:30,202 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:30,202 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1, ULTIMATE.start_cstrlcpy_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1 - 1*ULTIMATE.start_cstrlcpy_~s~0.offset Supporting invariants [] [2018-10-27 06:08:30,414 INFO L297 tatePredicateManager]: 14 out of 16 supporting invariants were superfluous and have been removed [2018-10-27 06:08:30,423 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:08:30,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:30,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:30,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:30,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:30,657 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-10-27 06:08:30,658 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states. Second operand 7 states. [2018-10-27 06:08:30,881 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states.. Second operand 7 states. Result 75 states and 97 transitions. Complement of second has 10 states. [2018-10-27 06:08:30,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:30,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:08:30,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2018-10-27 06:08:30,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 66 transitions. Stem has 9 letters. Loop has 6 letters. [2018-10-27 06:08:30,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:30,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 66 transitions. Stem has 15 letters. Loop has 6 letters. [2018-10-27 06:08:30,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:30,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 66 transitions. Stem has 9 letters. Loop has 12 letters. [2018-10-27 06:08:30,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:30,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 97 transitions. [2018-10-27 06:08:30,896 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-10-27 06:08:30,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 39 states and 47 transitions. [2018-10-27 06:08:30,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-10-27 06:08:30,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-10-27 06:08:30,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 47 transitions. [2018-10-27 06:08:30,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:30,902 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-10-27 06:08:30,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 47 transitions. [2018-10-27 06:08:30,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2018-10-27 06:08:30,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-27 06:08:30,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2018-10-27 06:08:30,930 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-10-27 06:08:30,930 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-10-27 06:08:30,931 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:08:30,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2018-10-27 06:08:30,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-10-27 06:08:30,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:30,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:30,932 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:30,932 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-10-27 06:08:30,933 INFO L793 eck$LassoCheckResult]: Stem: 274#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 272#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 273#L563 assume !(main_~length~0 < 1); 275#L563-2 assume !(main_~n~1 < 1); 267#L566-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~1 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset; 268#L571 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1) * 1, 1); srcloc: L571 277#L571-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1) * 1, 1); srcloc: L571-1 276#L572 assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 258#L546 assume !(cstrlcpy_~n~0 % 4294967296 != 0); 255#L546-1 assume cstrlcpy_~n~0 % 4294967296 == 0; 264#L553 assume !(cstrlcpy_~siz % 4294967296 != 0); 270#L555-4 [2018-10-27 06:08:30,933 INFO L795 eck$LassoCheckResult]: Loop: 270#L555-4 assume true; 265#L555 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset + 1; 266#L555-1 SUMMARY for call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); srcloc: L555-1 271#L555-2 assume !!(cstrlcpy_#t~mem7 != 0);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 270#L555-4 [2018-10-27 06:08:30,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:30,933 INFO L82 PathProgramCache]: Analyzing trace with hash 2052473895, now seen corresponding path program 1 times [2018-10-27 06:08:30,934 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:30,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:30,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:30,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:30,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:30,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:30,965 INFO L82 PathProgramCache]: Analyzing trace with hash 2711016, now seen corresponding path program 1 times [2018-10-27 06:08:30,965 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:30,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:30,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:30,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:30,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:30,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:30,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:30,974 INFO L82 PathProgramCache]: Analyzing trace with hash 534060814, now seen corresponding path program 1 times [2018-10-27 06:08:30,975 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:30,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:30,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:30,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:30,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:30,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:31,351 WARN L179 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 105 [2018-10-27 06:08:31,536 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2018-10-27 06:08:31,541 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:31,541 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:31,541 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:31,542 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:31,542 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:31,542 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:31,542 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:31,542 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:31,542 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-10-27 06:08:31,542 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:31,542 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:31,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:31,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:31,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:31,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:31,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:31,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:31,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:31,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:31,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:31,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:31,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:32,046 WARN L179 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 96 [2018-10-27 06:08:32,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:32,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:32,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:32,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:32,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:32,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:32,715 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:32,715 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:32,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:32,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:32,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:32,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:32,719 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:32,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:32,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:32,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:32,724 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:32,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:32,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:32,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:32,726 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:32,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,734 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:32,734 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:32,736 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:32,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:32,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:32,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:32,738 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:32,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:32,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:32,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:32,746 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:32,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:32,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:32,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:32,748 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:32,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:32,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:32,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:32,750 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:32,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,760 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:32,761 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:32,762 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:32,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:32,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:32,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:32,768 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,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-10-27 06:08:32,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,770 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:32,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:32,775 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,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-10-27 06:08:32,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,777 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:32,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:32,783 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,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-10-27 06:08:32,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,785 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:32,785 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:32,787 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,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-10-27 06:08:32,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,793 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:32,794 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:32,797 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:32,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,799 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:32,799 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:32,803 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:32,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,805 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:32,806 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:32,813 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:32,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,815 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:32,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,819 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:32,819 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:32,828 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:32,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,835 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:32,835 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:32,847 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:32,863 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:08:32,863 INFO L444 ModelExtractionUtils]: 29 out of 34 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:08:32,863 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:32,864 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:32,865 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:32,865 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrlcpy_~s~0.offset, v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2) = -1*ULTIMATE.start_cstrlcpy_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2 Supporting invariants [] [2018-10-27 06:08:32,990 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-10-27 06:08:32,992 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 06:08:32,993 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:08:32,993 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-10-27 06:08:33,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:33,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:33,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:33,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:33,175 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-10-27 06:08:33,175 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 33 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-10-27 06:08:33,266 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 33 transitions. cyclomatic complexity: 9. Second operand 7 states. Result 35 states and 43 transitions. Complement of second has 8 states. [2018-10-27 06:08:33,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:33,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:08:33,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2018-10-27 06:08:33,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 11 letters. Loop has 4 letters. [2018-10-27 06:08:33,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:33,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 15 letters. Loop has 4 letters. [2018-10-27 06:08:33,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:33,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 11 letters. Loop has 8 letters. [2018-10-27 06:08:33,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:33,270 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2018-10-27 06:08:33,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-10-27 06:08:33,274 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 26 states and 32 transitions. [2018-10-27 06:08:33,275 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-10-27 06:08:33,275 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-10-27 06:08:33,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2018-10-27 06:08:33,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:33,275 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-10-27 06:08:33,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2018-10-27 06:08:33,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-27 06:08:33,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-27 06:08:33,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2018-10-27 06:08:33,278 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-10-27 06:08:33,278 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-10-27 06:08:33,278 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:08:33,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2018-10-27 06:08:33,279 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-10-27 06:08:33,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:33,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:33,279 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:33,279 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-10-27 06:08:33,280 INFO L793 eck$LassoCheckResult]: Stem: 451#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 449#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 450#L563 assume !(main_~length~0 < 1); 452#L563-2 assume !(main_~n~1 < 1); 444#L566-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~1 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset; 445#L571 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1) * 1, 1); srcloc: L571 454#L571-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1) * 1, 1); srcloc: L571-1 453#L572 assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 432#L546 assume !(cstrlcpy_~n~0 % 4294967296 != 0); 434#L546-1 assume cstrlcpy_~n~0 % 4294967296 == 0; 441#L553 assume cstrlcpy_~siz % 4294967296 != 0; 446#L554 SUMMARY for call write~int(0, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, 1); srcloc: L554 447#L555-4 [2018-10-27 06:08:33,280 INFO L795 eck$LassoCheckResult]: Loop: 447#L555-4 assume true; 442#L555 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset + 1; 443#L555-1 SUMMARY for call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); srcloc: L555-1 448#L555-2 assume !!(cstrlcpy_#t~mem7 != 0);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 447#L555-4 [2018-10-27 06:08:33,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:33,284 INFO L82 PathProgramCache]: Analyzing trace with hash -797818736, now seen corresponding path program 1 times [2018-10-27 06:08:33,284 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:33,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:33,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:33,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:33,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:33,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:33,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:33,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:33,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 06:08:33,421 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:33,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:33,421 INFO L82 PathProgramCache]: Analyzing trace with hash 2711016, now seen corresponding path program 2 times [2018-10-27 06:08:33,422 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:33,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:33,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:33,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:33,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:33,602 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-10-27 06:08:33,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:08:33,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:08:33,626 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-10-27 06:08:33,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:33,654 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-10-27 06:08:33,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:08:33,655 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2018-10-27 06:08:33,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-10-27 06:08:33,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 28 states and 33 transitions. [2018-10-27 06:08:33,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-10-27 06:08:33,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-10-27 06:08:33,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2018-10-27 06:08:33,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:33,659 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-10-27 06:08:33,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2018-10-27 06:08:33,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-10-27 06:08:33,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-27 06:08:33,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-10-27 06:08:33,664 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-10-27 06:08:33,664 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-10-27 06:08:33,664 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:08:33,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 31 transitions. [2018-10-27 06:08:33,665 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-10-27 06:08:33,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:33,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:33,665 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:33,665 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-10-27 06:08:33,666 INFO L793 eck$LassoCheckResult]: Stem: 516#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 514#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 515#L563 assume !(main_~length~0 < 1); 517#L563-2 assume !(main_~n~1 < 1); 509#L566-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~1 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset; 510#L571 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1) * 1, 1); srcloc: L571 519#L571-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1) * 1, 1); srcloc: L571-1 518#L572 assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 497#L546 assume cstrlcpy_~n~0 % 4294967296 != 0; 498#L547-4 assume true; 499#L547-1 cstrlcpy_#t~pre2 := cstrlcpy_~n~0 - 1;cstrlcpy_~n~0 := cstrlcpy_~n~0 - 1; 500#L547-2 assume !(cstrlcpy_#t~pre2 % 4294967296 != 0);havoc cstrlcpy_#t~pre2; 503#L546-1 assume cstrlcpy_~n~0 % 4294967296 == 0; 506#L553 assume cstrlcpy_~siz % 4294967296 != 0; 511#L554 SUMMARY for call write~int(0, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, 1); srcloc: L554 512#L555-4 [2018-10-27 06:08:33,666 INFO L795 eck$LassoCheckResult]: Loop: 512#L555-4 assume true; 507#L555 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset + 1; 508#L555-1 SUMMARY for call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); srcloc: L555-1 513#L555-2 assume !!(cstrlcpy_#t~mem7 != 0);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 512#L555-4 [2018-10-27 06:08:33,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:33,666 INFO L82 PathProgramCache]: Analyzing trace with hash 912061087, now seen corresponding path program 1 times [2018-10-27 06:08:33,666 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:33,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:33,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:33,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:33,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:33,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:33,687 INFO L82 PathProgramCache]: Analyzing trace with hash 2711016, now seen corresponding path program 3 times [2018-10-27 06:08:33,688 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:33,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:33,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:33,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:33,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:33,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:33,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:33,693 INFO L82 PathProgramCache]: Analyzing trace with hash 57659782, now seen corresponding path program 1 times [2018-10-27 06:08:33,694 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:33,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:33,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:33,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:33,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:34,232 WARN L179 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 119 [2018-10-27 06:08:34,431 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-10-27 06:08:34,433 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:34,433 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:34,433 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:34,433 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:34,433 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:34,433 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:34,433 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:34,433 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:34,433 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-10-27 06:08:34,433 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:34,434 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:34,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,800 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 105 [2018-10-27 06:08:34,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:35,116 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2018-10-27 06:08:35,430 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:35,430 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:35,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:35,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,432 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:35,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:35,432 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:35,434 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:35,435 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:35,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,446 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:35,446 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:35,446 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:35,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,448 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:35,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:35,448 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,449 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:35,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,450 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:35,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:35,450 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,465 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:35,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:35,466 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,468 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:35,468 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:35,469 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,471 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:35,471 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:35,472 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,474 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:35,474 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:35,475 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:35,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,488 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:08:35,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,489 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:08:35,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:35,490 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:35,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:35,503 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,508 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:35,509 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:35,540 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:35,568 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-10-27 06:08:35,568 INFO L444 ModelExtractionUtils]: 58 out of 64 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-10-27 06:08:35,569 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:35,570 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:35,570 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:35,570 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3, ULTIMATE.start_cstrlcpy_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3 - 1*ULTIMATE.start_cstrlcpy_~s~0.offset Supporting invariants [] [2018-10-27 06:08:35,988 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2018-10-27 06:08:36,010 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 06:08:36,010 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:08:36,011 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-10-27 06:08:36,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:36,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:36,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:36,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:36,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:36,131 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-10-27 06:08:36,131 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 31 transitions. cyclomatic complexity: 7 Second operand 7 states. [2018-10-27 06:08:36,214 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 31 transitions. cyclomatic complexity: 7. Second operand 7 states. Result 31 states and 37 transitions. Complement of second has 8 states. [2018-10-27 06:08:36,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:36,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:08:36,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2018-10-27 06:08:36,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 15 letters. Loop has 4 letters. [2018-10-27 06:08:36,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:36,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 19 letters. Loop has 4 letters. [2018-10-27 06:08:36,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:36,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 15 letters. Loop has 8 letters. [2018-10-27 06:08:36,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:36,218 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. [2018-10-27 06:08:36,219 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:08:36,219 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2018-10-27 06:08:36,219 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:08:36,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:08:36,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:08:36,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:08:36,219 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:08:36,219 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:08:36,219 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:08:36,219 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:08:36,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:08:36,220 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:08:36,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:08:36,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:08:36 BoogieIcfgContainer [2018-10-27 06:08:36,228 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:08:36,229 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:08:36,229 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:08:36,229 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:08:36,229 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:26" (3/4) ... [2018-10-27 06:08:36,234 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:08:36,234 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:08:36,235 INFO L168 Benchmark]: Toolchain (without parser) took 11418.34 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 334.0 MB). Free memory was 952.2 MB in the beginning and 976.0 MB in the end (delta: -23.8 MB). Peak memory consumption was 310.2 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:36,236 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:08:36,236 INFO L168 Benchmark]: CACSL2BoogieTranslator took 418.73 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 930.7 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:36,237 INFO L168 Benchmark]: Boogie Procedure Inliner took 121.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 930.7 MB in the beginning and 1.2 GB in the end (delta: -233.9 MB). Peak memory consumption was 16.3 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:36,237 INFO L168 Benchmark]: Boogie Preprocessor took 27.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:36,238 INFO L168 Benchmark]: RCFGBuilder took 677.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:36,238 INFO L168 Benchmark]: BuchiAutomizer took 10162.81 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 165.7 MB). Free memory was 1.1 GB in the beginning and 983.6 MB in the end (delta: 154.0 MB). Peak memory consumption was 319.6 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:36,239 INFO L168 Benchmark]: Witness Printer took 5.53 ms. Allocated memory is still 1.4 GB. Free memory was 983.6 MB in the beginning and 976.0 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:36,243 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 418.73 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 930.7 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 121.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 930.7 MB in the beginning and 1.2 GB in the end (delta: -233.9 MB). Peak memory consumption was 16.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 677.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10162.81 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 165.7 MB). Free memory was 1.1 GB in the beginning and 983.6 MB in the end (delta: 154.0 MB). Peak memory consumption was 319.6 MB. Max. memory is 11.5 GB. * Witness Printer took 5.53 ms. Allocated memory is still 1.4 GB. Free memory was 983.6 MB in the beginning and 976.0 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (n * sizeof(char))] + -1 * s and consists of 7 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[#Ultimate.alloc_#res] and consists of 6 locations. One deterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * s and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.1s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 8.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 15 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 26 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 99 SDtfs, 131 SDslu, 109 SDs, 0 SdLazy, 69 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital243 mio100 ax100 hnf99 lsp97 ukn97 mio100 lsp40 div152 bol100 ite100 ukn100 eq178 hnf70 smp94 dnf100 smp100 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 29ms VariablesStem: 6 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...