./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a116d9da-21b7-47ef-b064-af32796582cd/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a116d9da-21b7-47ef-b064-af32796582cd/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a116d9da-21b7-47ef-b064-af32796582cd/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a116d9da-21b7-47ef-b064-af32796582cd/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a116d9da-21b7-47ef-b064-af32796582cd/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a116d9da-21b7-47ef-b064-af32796582cd/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 bb65be693a5a8084c5f6f02ff3a6e18ec8f053b3 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 13:23:01,373 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:23:01,374 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:23:01,383 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:23:01,383 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:23:01,384 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:23:01,385 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:23:01,386 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:23:01,387 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:23:01,388 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:23:01,389 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:23:01,389 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:23:01,390 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:23:01,390 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:23:01,391 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:23:01,392 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:23:01,393 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:23:01,394 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:23:01,396 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:23:01,397 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:23:01,398 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:23:01,399 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:23:01,401 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:23:01,401 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:23:01,401 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:23:01,402 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:23:01,402 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:23:01,403 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:23:01,404 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:23:01,405 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:23:01,405 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:23:01,405 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:23:01,406 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:23:01,406 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:23:01,407 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:23:01,407 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:23:01,408 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a116d9da-21b7-47ef-b064-af32796582cd/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 13:23:01,421 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:23:01,421 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:23:01,422 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:23:01,422 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:23:01,422 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:23:01,423 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 13:23:01,423 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 13:23:01,423 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 13:23:01,423 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 13:23:01,423 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 13:23:01,423 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 13:23:01,424 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:23:01,424 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:23:01,424 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 13:23:01,424 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:23:01,424 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:23:01,424 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:23:01,424 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 13:23:01,425 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 13:23:01,425 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 13:23:01,425 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:23:01,425 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:23:01,425 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 13:23:01,426 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:23:01,426 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 13:23:01,426 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:23:01,426 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:23:01,426 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 13:23:01,426 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:23:01,426 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:23:01,427 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 13:23:01,427 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 13:23:01,427 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_a116d9da-21b7-47ef-b064-af32796582cd/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 -> bb65be693a5a8084c5f6f02ff3a6e18ec8f053b3 [2018-11-28 13:23:01,454 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:23:01,463 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:23:01,465 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:23:01,466 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:23:01,467 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:23:01,467 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a116d9da-21b7-47ef-b064-af32796582cd/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-11-28 13:23:01,511 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a116d9da-21b7-47ef-b064-af32796582cd/bin-2019/uautomizer/data/aa2c75106/d03b86e3ed9f4f54b71df421ff8bebe6/FLAG5569f16bb [2018-11-28 13:23:01,909 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:23:01,910 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a116d9da-21b7-47ef-b064-af32796582cd/sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-11-28 13:23:01,920 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a116d9da-21b7-47ef-b064-af32796582cd/bin-2019/uautomizer/data/aa2c75106/d03b86e3ed9f4f54b71df421ff8bebe6/FLAG5569f16bb [2018-11-28 13:23:01,932 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a116d9da-21b7-47ef-b064-af32796582cd/bin-2019/uautomizer/data/aa2c75106/d03b86e3ed9f4f54b71df421ff8bebe6 [2018-11-28 13:23:01,934 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:23:01,935 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:23:01,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:23:01,936 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:23:01,938 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:23:01,939 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:23:01" (1/1) ... [2018-11-28 13:23:01,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ccf24a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:23:01, skipping insertion in model container [2018-11-28 13:23:01,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:23:01" (1/1) ... [2018-11-28 13:23:01,946 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:23:01,974 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:23:02,183 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:23:02,241 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:23:02,276 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:23:02,302 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:23:02,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:23:02 WrapperNode [2018-11-28 13:23:02,302 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:23:02,303 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:23:02,303 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:23:02,303 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:23:02,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:23:02" (1/1) ... [2018-11-28 13:23:02,321 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:23:02" (1/1) ... [2018-11-28 13:23:02,338 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:23:02,339 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:23:02,339 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:23:02,339 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:23:02,345 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:23:02" (1/1) ... [2018-11-28 13:23:02,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:23:02" (1/1) ... [2018-11-28 13:23:02,349 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:23:02" (1/1) ... [2018-11-28 13:23:02,349 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:23:02" (1/1) ... [2018-11-28 13:23:02,354 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:23:02" (1/1) ... [2018-11-28 13:23:02,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:23:02" (1/1) ... [2018-11-28 13:23:02,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:23:02" (1/1) ... [2018-11-28 13:23:02,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:23:02,362 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:23:02,362 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:23:02,362 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:23:02,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:23:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a116d9da-21b7-47ef-b064-af32796582cd/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:23:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:23:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 13:23:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 13:23:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:23:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:23:02,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:23:02,573 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:23:02,574 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 13:23:02,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:23:02 BoogieIcfgContainer [2018-11-28 13:23:02,574 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:23:02,575 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 13:23:02,575 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 13:23:02,578 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 13:23:02,579 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:23:02,579 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 01:23:01" (1/3) ... [2018-11-28 13:23:02,580 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5abb93d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:23:02, skipping insertion in model container [2018-11-28 13:23:02,581 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:23:02,581 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:23:02" (2/3) ... [2018-11-28 13:23:02,581 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5abb93d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:23:02, skipping insertion in model container [2018-11-28 13:23:02,581 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:23:02,581 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:23:02" (3/3) ... [2018-11-28 13:23:02,583 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-11-28 13:23:02,620 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:23:02,621 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 13:23:02,621 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 13:23:02,621 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 13:23:02,621 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:23:02,621 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:23:02,621 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 13:23:02,622 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:23:02,622 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 13:23:02,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-28 13:23:02,651 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 13:23:02,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:23:02,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:23:02,658 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 13:23:02,658 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 13:23:02,658 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 13:23:02,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-28 13:23:02,660 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 13:23:02,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:23:02,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:23:02,660 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 13:23:02,661 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 13:23:02,668 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true 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.base, main_#t~ret12.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9; 19#L559true assume !(main_~length~0 < 1); 6#L559-2true assume !(main_~n~0 < 1); 17#L562-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstrncpy_#in~dst.base, cstrncpy_#in~dst.offset, cstrncpy_#in~src.base, cstrncpy_#in~src.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, cstrncpy_#t~mem5, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, cstrncpy_#t~pre6, cstrncpy_#t~pre2, cstrncpy_~d~0.base, cstrncpy_~d~0.offset, cstrncpy_~s~0.base, cstrncpy_~s~0.offset, cstrncpy_~dst.base, cstrncpy_~dst.offset, cstrncpy_~src.base, cstrncpy_~src.offset, cstrncpy_~n;cstrncpy_~dst.base, cstrncpy_~dst.offset := cstrncpy_#in~dst.base, cstrncpy_#in~dst.offset;cstrncpy_~src.base, cstrncpy_~src.offset := cstrncpy_#in~src.base, cstrncpy_#in~src.offset;cstrncpy_~n := cstrncpy_#in~n; 11#L543true assume 0 != cstrncpy_~n % 4294967296;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_~dst.base, cstrncpy_~dst.offset;cstrncpy_~s~0.base, cstrncpy_~s~0.offset := cstrncpy_~src.base, cstrncpy_~src.offset; 13#L546-4true [2018-11-28 13:23:02,669 INFO L796 eck$LassoCheckResult]: Loop: 13#L546-4true cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset := cstrncpy_~d~0.base, cstrncpy_~d~0.offset;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_#t~post3.base, 1 + cstrncpy_#t~post3.offset;cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset := cstrncpy_~s~0.base, cstrncpy_~s~0.offset;cstrncpy_~s~0.base, cstrncpy_~s~0.offset := cstrncpy_#t~post4.base, 1 + cstrncpy_#t~post4.offset;call cstrncpy_#t~mem5 := read~int(cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, 1);call write~int(cstrncpy_#t~mem5, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, 1); 4#L547true assume !(0 == cstrncpy_#t~mem5);havoc cstrncpy_#t~mem5;havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset; 8#L546-1true cstrncpy_#t~pre2 := cstrncpy_~n - 1;cstrncpy_~n := cstrncpy_~n - 1; 9#L546-2true assume !!(0 != cstrncpy_#t~pre2 % 4294967296);havoc cstrncpy_#t~pre2; 13#L546-4true [2018-11-28 13:23:02,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:23:02,674 INFO L82 PathProgramCache]: Analyzing trace with hash 889572236, now seen corresponding path program 1 times [2018-11-28 13:23:02,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:23:02,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:23:02,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:23:02,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:23:02,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:23:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:23:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:23:02,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:23:02,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1618712, now seen corresponding path program 1 times [2018-11-28 13:23:02,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:23:02,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:23:02,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:23:02,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:23:02,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:23:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:23:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:23:02,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:23:02,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1592246563, now seen corresponding path program 1 times [2018-11-28 13:23:02,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:23:02,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:23:02,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:23:02,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:23:02,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:23:02,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:23:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:23:02,987 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-28 13:23:03,247 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2018-11-28 13:23:03,345 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:23:03,346 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:23:03,346 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:23:03,346 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:23:03,346 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:23:03,346 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:23:03,347 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:23:03,347 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:23:03,347 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-28 13:23:03,347 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:23:03,347 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:23:03,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:03,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:03,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:03,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:03,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:03,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:03,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:03,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:03,615 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2018-11-28 13:23:03,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:03,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:03,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:03,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:03,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:03,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:03,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:03,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:03,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:03,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:03,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:03,901 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2018-11-28 13:23:04,261 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:23:04,266 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:23:04,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:23:04,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:23:04,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:23:04,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:23:04,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:23:04,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:23:04,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:23:04,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:23:04,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:23:04,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:23:04,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:23:04,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:23:04,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:23:04,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:23:04,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:23:04,276 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:23:04,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:23:04,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:23:04,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:23:04,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:23:04,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:23:04,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:23:04,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:23:04,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:23:04,279 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:23:04,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:23:04,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:23:04,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:23:04,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:23:04,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:23:04,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:23:04,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:23:04,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:23:04,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:23:04,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:23:04,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:23:04,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:23:04,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:23:04,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:23:04,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:23:04,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:23:04,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:23:04,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:23:04,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:23:04,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:23:04,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:23:04,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:23:04,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:23:04,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:23:04,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:23:04,288 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:23:04,288 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:23:04,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:23:04,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:23:04,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:23:04,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:23:04,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:23:04,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:23:04,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:23:04,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:23:04,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:23:04,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:23:04,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:23:04,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:23:04,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:23:04,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:23:04,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:23:04,306 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:23:04,306 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:23:04,376 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:23:04,435 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 13:23:04,435 INFO L444 ModelExtractionUtils]: 50 out of 55 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 13:23:04,438 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:23:04,439 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:23:04,439 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:23:04,440 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1) = -1*ULTIMATE.start_cstrncpy_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1 Supporting invariants [] [2018-11-28 13:23:04,485 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-11-28 13:23:04,494 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 13:23:04,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:23:04,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:23:04,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:23:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:23:04,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:23:04,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:23:04,648 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-28 13:23:04,650 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2018-11-28 13:23:04,763 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 4 states. Result 36 states and 44 transitions. Complement of second has 7 states. [2018-11-28 13:23:04,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 13:23:04,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 13:23:04,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2018-11-28 13:23:04,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 13:23:04,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:23:04,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-28 13:23:04,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:23:04,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-28 13:23:04,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:23:04,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 44 transitions. [2018-11-28 13:23:04,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:23:04,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 14 states and 17 transitions. [2018-11-28 13:23:04,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 13:23:04,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 13:23:04,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2018-11-28 13:23:04,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:23:04,778 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-28 13:23:04,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2018-11-28 13:23:04,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-11-28 13:23:04,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 13:23:04,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-11-28 13:23:04,797 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-28 13:23:04,797 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-28 13:23:04,797 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 13:23:04,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2018-11-28 13:23:04,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:23:04,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:23:04,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:23:04,798 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:23:04,798 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:23:04,798 INFO L794 eck$LassoCheckResult]: Stem: 175#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 168#L-1 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.base, main_#t~ret12.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9; 169#L559 assume !(main_~length~0 < 1); 177#L559-2 assume !(main_~n~0 < 1); 178#L562-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstrncpy_#in~dst.base, cstrncpy_#in~dst.offset, cstrncpy_#in~src.base, cstrncpy_#in~src.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, cstrncpy_#t~mem5, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, cstrncpy_#t~pre6, cstrncpy_#t~pre2, cstrncpy_~d~0.base, cstrncpy_~d~0.offset, cstrncpy_~s~0.base, cstrncpy_~s~0.offset, cstrncpy_~dst.base, cstrncpy_~dst.offset, cstrncpy_~src.base, cstrncpy_~src.offset, cstrncpy_~n;cstrncpy_~dst.base, cstrncpy_~dst.offset := cstrncpy_#in~dst.base, cstrncpy_#in~dst.offset;cstrncpy_~src.base, cstrncpy_~src.offset := cstrncpy_#in~src.base, cstrncpy_#in~src.offset;cstrncpy_~n := cstrncpy_#in~n; 180#L543 assume 0 != cstrncpy_~n % 4294967296;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_~dst.base, cstrncpy_~dst.offset;cstrncpy_~s~0.base, cstrncpy_~s~0.offset := cstrncpy_~src.base, cstrncpy_~src.offset; 170#L546-4 cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset := cstrncpy_~d~0.base, cstrncpy_~d~0.offset;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_#t~post3.base, 1 + cstrncpy_#t~post3.offset;cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset := cstrncpy_~s~0.base, cstrncpy_~s~0.offset;cstrncpy_~s~0.base, cstrncpy_~s~0.offset := cstrncpy_#t~post4.base, 1 + cstrncpy_#t~post4.offset;call cstrncpy_#t~mem5 := read~int(cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, 1);call write~int(cstrncpy_#t~mem5, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, 1); 171#L547 assume 0 == cstrncpy_#t~mem5;havoc cstrncpy_#t~mem5;havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset; 174#L548-3 [2018-11-28 13:23:04,798 INFO L796 eck$LassoCheckResult]: Loop: 174#L548-3 cstrncpy_#t~pre6 := cstrncpy_~n - 1;cstrncpy_~n := cstrncpy_~n - 1; 176#L548-1 assume !!(0 != cstrncpy_#t~pre6 % 4294967296);havoc cstrncpy_#t~pre6;cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset := cstrncpy_~d~0.base, cstrncpy_~d~0.offset;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_#t~post7.base, 1 + cstrncpy_#t~post7.offset;call write~int(0, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, 1);havoc cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset; 174#L548-3 [2018-11-28 13:23:04,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:23:04,799 INFO L82 PathProgramCache]: Analyzing trace with hash 180427599, now seen corresponding path program 1 times [2018-11-28 13:23:04,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:23:04,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:23:04,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:23:04,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:23:04,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:23:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:23:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:23:04,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:23:04,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1926, now seen corresponding path program 1 times [2018-11-28 13:23:04,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:23:04,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:23:04,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:23:04,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:23:04,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:23:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:23:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:23:04,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:23:04,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1592231764, now seen corresponding path program 1 times [2018-11-28 13:23:04,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:23:04,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:23:04,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:23:04,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:23:04,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:23:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:23:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:23:05,242 WARN L180 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 120 [2018-11-28 13:23:05,335 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:23:05,335 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:23:05,335 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:23:05,335 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:23:05,335 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:23:05,335 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:23:05,335 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:23:05,335 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:23:05,335 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-28 13:23:05,335 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:23:05,335 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:23:05,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:05,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:05,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:05,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:05,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:05,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:05,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:05,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:05,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:05,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:05,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:05,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:05,552 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2018-11-28 13:23:05,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:05,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:05,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:05,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:05,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:05,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:05,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:23:05,738 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2018-11-28 13:23:06,071 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:23:06,071 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:23:06,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:23:06,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:23:06,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:23:06,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:23:06,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:23:06,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:23:06,073 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:23:06,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:23:06,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:23:06,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:23:06,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:23:06,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:23:06,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:23:06,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:23:06,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:23:06,079 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:23:06,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:23:06,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:23:06,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:23:06,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:23:06,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:23:06,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:23:06,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:23:06,081 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:23:06,081 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:23:06,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:23:06,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:23:06,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:23:06,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:23:06,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:23:06,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:23:06,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:23:06,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:23:06,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:23:06,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:23:06,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:23:06,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:23:06,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:23:06,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:23:06,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:23:06,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:23:06,086 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:23:06,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:23:06,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:23:06,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:23:06,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:23:06,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:23:06,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:23:06,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:23:06,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:23:06,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:23:06,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:23:06,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:23:06,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:23:06,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:23:06,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:23:06,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:23:06,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:23:06,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:23:06,090 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:23:06,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:23:06,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:23:06,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:23:06,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:23:06,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:23:06,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:23:06,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:23:06,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:23:06,092 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:23:06,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:23:06,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:23:06,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:23:06,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:23:06,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:23:06,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:23:06,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:23:06,094 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:23:06,094 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:23:06,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:23:06,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:23:06,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:23:06,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:23:06,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:23:06,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:23:06,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:23:06,097 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:23:06,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:23:06,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:23:06,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:23:06,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:23:06,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:23:06,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:23:06,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:23:06,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:23:06,100 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:23:06,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:23:06,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:23:06,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:23:06,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:23:06,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:23:06,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:23:06,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:23:06,105 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:23:06,105 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:23:06,124 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:23:06,144 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 13:23:06,144 INFO L444 ModelExtractionUtils]: 36 out of 43 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 13:23:06,144 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:23:06,145 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:23:06,145 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:23:06,146 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_2, ULTIMATE.start_cstrncpy_~d~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_2 - 1*ULTIMATE.start_cstrncpy_~d~0.offset Supporting invariants [] [2018-11-28 13:23:06,182 INFO L297 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2018-11-28 13:23:06,184 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 13:23:06,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:23:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:23:06,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:23:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:23:06,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:23:06,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:23:06,234 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 1 loop predicates [2018-11-28 13:23:06,234 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-28 13:23:06,274 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 15 states and 19 transitions. Complement of second has 6 states. [2018-11-28 13:23:06,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 13:23:06,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 13:23:06,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2018-11-28 13:23:06,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-28 13:23:06,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:23:06,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 10 letters. Loop has 2 letters. [2018-11-28 13:23:06,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:23:06,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-28 13:23:06,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:23:06,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2018-11-28 13:23:06,277 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 13:23:06,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2018-11-28 13:23:06,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 13:23:06,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 13:23:06,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 13:23:06,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:23:06,278 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:23:06,278 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:23:06,278 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:23:06,278 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 13:23:06,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 13:23:06,278 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 13:23:06,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 13:23:06,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 01:23:06 BoogieIcfgContainer [2018-11-28 13:23:06,284 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 13:23:06,284 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:23:06,284 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:23:06,284 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:23:06,285 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:23:02" (3/4) ... [2018-11-28 13:23:06,289 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 13:23:06,289 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:23:06,290 INFO L168 Benchmark]: Toolchain (without parser) took 4355.13 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 306.2 MB). Free memory was 951.7 MB in the beginning and 1.2 GB in the end (delta: -244.0 MB). Peak memory consumption was 62.1 MB. Max. memory is 11.5 GB. [2018-11-28 13:23:06,290 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:23:06,291 INFO L168 Benchmark]: CACSL2BoogieTranslator took 366.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -189.5 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2018-11-28 13:23:06,292 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:23:06,292 INFO L168 Benchmark]: Boogie Preprocessor took 22.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-28 13:23:06,292 INFO L168 Benchmark]: RCFGBuilder took 212.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2018-11-28 13:23:06,293 INFO L168 Benchmark]: BuchiAutomizer took 3708.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 149.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -82.4 MB). Peak memory consumption was 67.5 MB. Max. memory is 11.5 GB. [2018-11-28 13:23:06,294 INFO L168 Benchmark]: Witness Printer took 5.15 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:23:06,297 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 366.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -189.5 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 212.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3708.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 149.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -82.4 MB). Peak memory consumption was 67.5 MB. Max. memory is 11.5 GB. * Witness Printer took 5.15 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length * sizeof(char))] and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (n * sizeof(char))] + -1 * d and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.6s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 13 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 31 SDtfs, 37 SDslu, 26 SDs, 0 SdLazy, 16 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital231 mio100 ax100 hnf99 lsp97 ukn84 mio100 lsp52 div181 bol100 ite100 ukn100 eq173 hnf68 smp93 dnf100 smp100 tf100 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...