./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_82096b7f-7dec-44d3-818d-082aa16043fa/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_82096b7f-7dec-44d3-818d-082aa16043fa/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_82096b7f-7dec-44d3-818d-082aa16043fa/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_82096b7f-7dec-44d3-818d-082aa16043fa/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_82096b7f-7dec-44d3-818d-082aa16043fa/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_82096b7f-7dec-44d3-818d-082aa16043fa/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --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-635dfa2 [2018-12-02 21:30:24,878 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 21:30:24,879 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 21:30:24,885 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 21:30:24,885 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 21:30:24,885 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 21:30:24,886 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 21:30:24,887 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 21:30:24,887 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 21:30:24,888 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 21:30:24,888 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 21:30:24,888 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 21:30:24,889 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 21:30:24,889 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 21:30:24,890 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 21:30:24,890 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 21:30:24,890 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 21:30:24,891 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 21:30:24,892 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 21:30:24,893 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 21:30:24,893 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 21:30:24,894 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 21:30:24,895 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 21:30:24,895 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 21:30:24,895 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 21:30:24,896 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 21:30:24,896 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 21:30:24,896 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 21:30:24,897 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 21:30:24,897 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 21:30:24,897 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 21:30:24,898 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 21:30:24,898 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 21:30:24,898 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 21:30:24,898 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 21:30:24,899 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 21:30:24,899 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_82096b7f-7dec-44d3-818d-082aa16043fa/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-02 21:30:24,906 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 21:30:24,906 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 21:30:24,906 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 21:30:24,906 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 21:30:24,907 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 21:30:24,907 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 21:30:24,907 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 21:30:24,907 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 21:30:24,907 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 21:30:24,907 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 21:30:24,907 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 21:30:24,907 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 21:30:24,907 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 21:30:24,907 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 21:30:24,907 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 21:30:24,908 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 21:30:24,908 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 21:30:24,908 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 21:30:24,908 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 21:30:24,908 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 21:30:24,908 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 21:30:24,908 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 21:30:24,908 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 21:30:24,908 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 21:30:24,908 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 21:30:24,908 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 21:30:24,908 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 21:30:24,908 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 21:30:24,909 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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_82096b7f-7dec-44d3-818d-082aa16043fa/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(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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-12-02 21:30:24,926 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 21:30:24,932 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 21:30:24,934 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 21:30:24,935 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 21:30:24,935 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 21:30:24,936 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_82096b7f-7dec-44d3-818d-082aa16043fa/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-12-02 21:30:24,971 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_82096b7f-7dec-44d3-818d-082aa16043fa/bin-2019/uautomizer/data/9422624ad/79a20bb10bc749fc82d899ae8d1ebc3d/FLAGc23358b35 [2018-12-02 21:30:25,391 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 21:30:25,391 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_82096b7f-7dec-44d3-818d-082aa16043fa/sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-12-02 21:30:25,397 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_82096b7f-7dec-44d3-818d-082aa16043fa/bin-2019/uautomizer/data/9422624ad/79a20bb10bc749fc82d899ae8d1ebc3d/FLAGc23358b35 [2018-12-02 21:30:25,405 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_82096b7f-7dec-44d3-818d-082aa16043fa/bin-2019/uautomizer/data/9422624ad/79a20bb10bc749fc82d899ae8d1ebc3d [2018-12-02 21:30:25,407 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 21:30:25,408 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-02 21:30:25,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 21:30:25,409 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 21:30:25,411 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 21:30:25,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:30:25" (1/1) ... [2018-12-02 21:30:25,413 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23ef7631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:30:25, skipping insertion in model container [2018-12-02 21:30:25,413 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:30:25" (1/1) ... [2018-12-02 21:30:25,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 21:30:25,435 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 21:30:25,579 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:30:25,586 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 21:30:25,640 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:30:25,659 INFO L195 MainTranslator]: Completed translation [2018-12-02 21:30:25,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:30:25 WrapperNode [2018-12-02 21:30:25,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 21:30:25,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 21:30:25,660 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 21:30:25,660 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 21:30:25,668 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:30:25" (1/1) ... [2018-12-02 21:30:25,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:30:25" (1/1) ... [2018-12-02 21:30:25,675 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:30:25" (1/1) ... [2018-12-02 21:30:25,675 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:30:25" (1/1) ... [2018-12-02 21:30:25,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:30:25" (1/1) ... [2018-12-02 21:30:25,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:30:25" (1/1) ... [2018-12-02 21:30:25,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:30:25" (1/1) ... [2018-12-02 21:30:25,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 21:30:25,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 21:30:25,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 21:30:25,688 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 21:30:25,689 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:30:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82096b7f-7dec-44d3-818d-082aa16043fa/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 21:30:25,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 21:30:25,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 21:30:25,719 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-02 21:30:25,719 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-02 21:30:25,719 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrncpy [2018-12-02 21:30:25,719 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 21:30:25,720 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-02 21:30:25,720 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-02 21:30:25,720 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-02 21:30:25,720 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-02 21:30:25,720 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-02 21:30:25,720 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-02 21:30:25,720 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-02 21:30:25,720 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-02 21:30:25,720 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-02 21:30:25,720 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-02 21:30:25,721 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-02 21:30:25,721 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-02 21:30:25,721 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-02 21:30:25,721 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-02 21:30:25,721 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-02 21:30:25,721 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-02 21:30:25,721 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-02 21:30:25,721 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-02 21:30:25,722 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-02 21:30:25,722 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-02 21:30:25,722 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-02 21:30:25,722 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-02 21:30:25,722 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-02 21:30:25,722 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-02 21:30:25,722 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-02 21:30:25,722 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-02 21:30:25,722 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-02 21:30:25,723 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-02 21:30:25,723 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-02 21:30:25,723 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-02 21:30:25,723 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-02 21:30:25,723 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-02 21:30:25,723 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-02 21:30:25,723 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-02 21:30:25,723 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-02 21:30:25,723 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-02 21:30:25,723 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-02 21:30:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-02 21:30:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-02 21:30:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-02 21:30:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-02 21:30:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-02 21:30:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-02 21:30:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-02 21:30:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-02 21:30:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-02 21:30:25,725 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-02 21:30:25,725 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-02 21:30:25,725 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-02 21:30:25,725 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-02 21:30:25,725 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-02 21:30:25,725 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-02 21:30:25,725 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-02 21:30:25,725 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-02 21:30:25,725 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-02 21:30:25,725 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-02 21:30:25,725 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-02 21:30:25,726 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-02 21:30:25,726 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-02 21:30:25,726 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-02 21:30:25,726 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-02 21:30:25,726 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-02 21:30:25,726 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-02 21:30:25,726 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-02 21:30:25,726 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-02 21:30:25,726 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-02 21:30:25,726 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-02 21:30:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-02 21:30:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-02 21:30:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-02 21:30:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-02 21:30:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-02 21:30:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-02 21:30:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-02 21:30:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-02 21:30:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-02 21:30:25,728 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-02 21:30:25,728 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-02 21:30:25,728 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-02 21:30:25,728 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-02 21:30:25,728 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-02 21:30:25,728 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-02 21:30:25,728 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-02 21:30:25,728 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-02 21:30:25,729 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-02 21:30:25,729 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-02 21:30:25,729 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-02 21:30:25,729 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-02 21:30:25,729 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-02 21:30:25,729 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-02 21:30:25,729 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-02 21:30:25,729 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-02 21:30:25,729 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-02 21:30:25,729 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-02 21:30:25,730 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-02 21:30:25,730 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-02 21:30:25,730 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-02 21:30:25,730 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-02 21:30:25,730 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-02 21:30:25,730 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-02 21:30:25,730 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-02 21:30:25,730 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-02 21:30:25,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-02 21:30:25,731 INFO L130 BoogieDeclarations]: Found specification of procedure cstrncpy [2018-12-02 21:30:25,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 21:30:25,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 21:30:25,731 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 21:30:25,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 21:30:25,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 21:30:25,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 21:30:25,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 21:30:25,925 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 21:30:25,925 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 21:30:25,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:30:25 BoogieIcfgContainer [2018-12-02 21:30:25,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 21:30:25,926 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 21:30:25,926 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 21:30:25,927 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 21:30:25,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 09:30:25" (1/3) ... [2018-12-02 21:30:25,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6182cea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:30:25, skipping insertion in model container [2018-12-02 21:30:25,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:30:25" (2/3) ... [2018-12-02 21:30:25,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6182cea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:30:25, skipping insertion in model container [2018-12-02 21:30:25,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:30:25" (3/3) ... [2018-12-02 21:30:25,929 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-12-02 21:30:25,935 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 21:30:25,940 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-12-02 21:30:25,951 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-12-02 21:30:25,965 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 21:30:25,965 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 21:30:25,966 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 21:30:25,966 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 21:30:25,966 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 21:30:25,966 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 21:30:25,966 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 21:30:25,966 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 21:30:25,966 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 21:30:25,974 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-12-02 21:30:25,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 21:30:25,979 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:30:25,979 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:30:25,981 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 21:30:25,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:30:25,984 INFO L82 PathProgramCache]: Analyzing trace with hash 412779915, now seen corresponding path program 1 times [2018-12-02 21:30:25,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:30:25,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:30:26,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:26,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:30:26,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:26,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:26,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:30:26,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 21:30:26,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:30:26,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:30:26,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:30:26,101 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2018-12-02 21:30:26,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:30:26,128 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-12-02 21:30:26,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:30:26,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 21:30:26,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:30:26,135 INFO L225 Difference]: With dead ends: 39 [2018-12-02 21:30:26,135 INFO L226 Difference]: Without dead ends: 36 [2018-12-02 21:30:26,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:30:26,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-02 21:30:26,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-02 21:30:26,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-02 21:30:26,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-12-02 21:30:26,156 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 10 [2018-12-02 21:30:26,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:30:26,157 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-12-02 21:30:26,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:30:26,157 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-12-02 21:30:26,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 21:30:26,157 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:30:26,157 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:30:26,157 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 21:30:26,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:30:26,158 INFO L82 PathProgramCache]: Analyzing trace with hash 412779916, now seen corresponding path program 1 times [2018-12-02 21:30:26,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:30:26,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:30:26,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:26,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:30:26,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:26,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:26,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:30:26,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 21:30:26,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 21:30:26,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 21:30:26,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 21:30:26,205 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 4 states. [2018-12-02 21:30:26,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:30:26,218 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-12-02 21:30:26,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 21:30:26,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-02 21:30:26,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:30:26,219 INFO L225 Difference]: With dead ends: 35 [2018-12-02 21:30:26,219 INFO L226 Difference]: Without dead ends: 35 [2018-12-02 21:30:26,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 21:30:26,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-02 21:30:26,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-02 21:30:26,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-02 21:30:26,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-12-02 21:30:26,224 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 10 [2018-12-02 21:30:26,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:30:26,224 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-12-02 21:30:26,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 21:30:26,224 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2018-12-02 21:30:26,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 21:30:26,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:30:26,225 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:30:26,225 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 21:30:26,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:30:26,226 INFO L82 PathProgramCache]: Analyzing trace with hash 472169900, now seen corresponding path program 1 times [2018-12-02 21:30:26,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:30:26,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:30:26,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:26,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:30:26,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:26,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:26,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:30:26,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 21:30:26,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 21:30:26,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 21:30:26,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:30:26,277 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 7 states. [2018-12-02 21:30:26,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:30:26,363 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-12-02 21:30:26,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 21:30:26,363 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-02 21:30:26,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:30:26,365 INFO L225 Difference]: With dead ends: 37 [2018-12-02 21:30:26,365 INFO L226 Difference]: Without dead ends: 37 [2018-12-02 21:30:26,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-02 21:30:26,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-02 21:30:26,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2018-12-02 21:30:26,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-02 21:30:26,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-12-02 21:30:26,369 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 15 [2018-12-02 21:30:26,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:30:26,369 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-12-02 21:30:26,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 21:30:26,369 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-12-02 21:30:26,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 21:30:26,370 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:30:26,370 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:30:26,370 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 21:30:26,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:30:26,370 INFO L82 PathProgramCache]: Analyzing trace with hash 472169901, now seen corresponding path program 1 times [2018-12-02 21:30:26,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:30:26,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:30:26,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:26,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:30:26,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:26,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:26,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:30:26,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 21:30:26,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 21:30:26,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 21:30:26,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-02 21:30:26,458 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 9 states. [2018-12-02 21:30:26,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:30:26,550 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-12-02 21:30:26,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 21:30:26,550 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-12-02 21:30:26,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:30:26,551 INFO L225 Difference]: With dead ends: 40 [2018-12-02 21:30:26,551 INFO L226 Difference]: Without dead ends: 40 [2018-12-02 21:30:26,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-12-02 21:30:26,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-02 21:30:26,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-12-02 21:30:26,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-02 21:30:26,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-12-02 21:30:26,556 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 15 [2018-12-02 21:30:26,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:30:26,556 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-12-02 21:30:26,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 21:30:26,556 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-12-02 21:30:26,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 21:30:26,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:30:26,557 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:30:26,557 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 21:30:26,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:30:26,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1752364997, now seen corresponding path program 1 times [2018-12-02 21:30:26,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:30:26,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:30:26,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:26,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:30:26,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:26,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:26,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:30:26,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 21:30:26,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 21:30:26,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 21:30:26,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:30:26,623 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 8 states. [2018-12-02 21:30:26,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:30:26,682 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-12-02 21:30:26,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 21:30:26,683 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-02 21:30:26,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:30:26,683 INFO L225 Difference]: With dead ends: 38 [2018-12-02 21:30:26,684 INFO L226 Difference]: Without dead ends: 38 [2018-12-02 21:30:26,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-12-02 21:30:26,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-02 21:30:26,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2018-12-02 21:30:26,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-02 21:30:26,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-12-02 21:30:26,687 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 16 [2018-12-02 21:30:26,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:30:26,687 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-12-02 21:30:26,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 21:30:26,688 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2018-12-02 21:30:26,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 21:30:26,688 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:30:26,688 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:30:26,688 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 21:30:26,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:30:26,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1752364998, now seen corresponding path program 1 times [2018-12-02 21:30:26,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:30:26,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:30:26,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:26,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:30:26,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:26,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:26,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:30:26,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 21:30:26,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 21:30:26,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 21:30:26,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:30:26,754 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 8 states. [2018-12-02 21:30:26,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:30:26,824 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2018-12-02 21:30:26,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 21:30:26,825 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-02 21:30:26,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:30:26,825 INFO L225 Difference]: With dead ends: 37 [2018-12-02 21:30:26,825 INFO L226 Difference]: Without dead ends: 37 [2018-12-02 21:30:26,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-12-02 21:30:26,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-02 21:30:26,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-12-02 21:30:26,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-02 21:30:26,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-12-02 21:30:26,827 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 16 [2018-12-02 21:30:26,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:30:26,828 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-12-02 21:30:26,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 21:30:26,828 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-12-02 21:30:26,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 21:30:26,828 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:30:26,828 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:30:26,828 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 21:30:26,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:30:26,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1695369597, now seen corresponding path program 1 times [2018-12-02 21:30:26,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:30:26,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:30:26,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:26,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:30:26,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:26,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:26,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:26,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:30:26,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 21:30:26,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:30:26,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:30:26,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:30:26,855 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 5 states. [2018-12-02 21:30:26,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:30:26,882 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-12-02 21:30:26,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:30:26,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-02 21:30:26,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:30:26,883 INFO L225 Difference]: With dead ends: 48 [2018-12-02 21:30:26,883 INFO L226 Difference]: Without dead ends: 48 [2018-12-02 21:30:26,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:30:26,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-02 21:30:26,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2018-12-02 21:30:26,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 21:30:26,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-12-02 21:30:26,889 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 18 [2018-12-02 21:30:26,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:30:26,889 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-12-02 21:30:26,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:30:26,889 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-12-02 21:30:26,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 21:30:26,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:30:26,889 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:30:26,890 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 21:30:26,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:30:26,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1898533121, now seen corresponding path program 1 times [2018-12-02 21:30:26,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:30:26,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:30:26,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:26,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:30:26,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:26,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:26,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:30:26,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 21:30:26,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 21:30:26,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 21:30:26,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 21:30:26,934 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 4 states. [2018-12-02 21:30:26,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:30:26,968 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-12-02 21:30:26,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 21:30:26,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-02 21:30:26,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:30:26,969 INFO L225 Difference]: With dead ends: 41 [2018-12-02 21:30:26,969 INFO L226 Difference]: Without dead ends: 33 [2018-12-02 21:30:26,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 21:30:26,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-02 21:30:26,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-12-02 21:30:26,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-02 21:30:26,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-12-02 21:30:26,971 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 18 [2018-12-02 21:30:26,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:30:26,971 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-12-02 21:30:26,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 21:30:26,971 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-12-02 21:30:26,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 21:30:26,972 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:30:26,972 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:30:26,972 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 21:30:26,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:30:26,972 INFO L82 PathProgramCache]: Analyzing trace with hash -2098008373, now seen corresponding path program 1 times [2018-12-02 21:30:26,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:30:26,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:30:26,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:26,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:30:26,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:26,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:26,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:30:26,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 21:30:26,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:30:26,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:30:26,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:30:26,998 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 5 states. [2018-12-02 21:30:27,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:30:27,035 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-12-02 21:30:27,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:30:27,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-02 21:30:27,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:30:27,036 INFO L225 Difference]: With dead ends: 29 [2018-12-02 21:30:27,036 INFO L226 Difference]: Without dead ends: 29 [2018-12-02 21:30:27,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:30:27,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-02 21:30:27,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-02 21:30:27,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-02 21:30:27,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-12-02 21:30:27,038 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 20 [2018-12-02 21:30:27,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:30:27,038 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-12-02 21:30:27,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:30:27,038 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-12-02 21:30:27,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 21:30:27,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:30:27,039 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:30:27,039 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 21:30:27,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:30:27,039 INFO L82 PathProgramCache]: Analyzing trace with hash -2098008372, now seen corresponding path program 1 times [2018-12-02 21:30:27,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:30:27,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:30:27,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:27,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:30:27,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:27,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:27,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:30:27,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 21:30:27,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 21:30:27,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 21:30:27,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:30:27,122 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 7 states. [2018-12-02 21:30:27,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:30:27,170 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-12-02 21:30:27,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 21:30:27,171 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-12-02 21:30:27,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:30:27,171 INFO L225 Difference]: With dead ends: 63 [2018-12-02 21:30:27,171 INFO L226 Difference]: Without dead ends: 61 [2018-12-02 21:30:27,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-02 21:30:27,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-02 21:30:27,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 38. [2018-12-02 21:30:27,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-02 21:30:27,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-12-02 21:30:27,173 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 20 [2018-12-02 21:30:27,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:30:27,174 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-12-02 21:30:27,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 21:30:27,174 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-12-02 21:30:27,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 21:30:27,174 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:30:27,174 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:30:27,174 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 21:30:27,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:30:27,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1610152910, now seen corresponding path program 1 times [2018-12-02 21:30:27,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:30:27,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:30:27,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:27,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:30:27,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:27,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:27,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:30:27,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 21:30:27,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 21:30:27,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 21:30:27,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-02 21:30:27,314 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 11 states. [2018-12-02 21:30:27,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:30:27,468 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-12-02 21:30:27,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 21:30:27,469 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-02 21:30:27,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:30:27,469 INFO L225 Difference]: With dead ends: 44 [2018-12-02 21:30:27,469 INFO L226 Difference]: Without dead ends: 44 [2018-12-02 21:30:27,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2018-12-02 21:30:27,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-02 21:30:27,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-12-02 21:30:27,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 21:30:27,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-12-02 21:30:27,479 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 20 [2018-12-02 21:30:27,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:30:27,479 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-12-02 21:30:27,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 21:30:27,479 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-12-02 21:30:27,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 21:30:27,479 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:30:27,480 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:30:27,480 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 21:30:27,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:30:27,481 INFO L82 PathProgramCache]: Analyzing trace with hash -595711829, now seen corresponding path program 1 times [2018-12-02 21:30:27,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:30:27,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:30:27,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:27,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:30:27,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:27,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:27,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:30:27,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 21:30:27,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 21:30:27,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 21:30:27,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:30:27,549 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 7 states. [2018-12-02 21:30:27,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:30:27,578 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-12-02 21:30:27,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:30:27,578 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-12-02 21:30:27,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:30:27,578 INFO L225 Difference]: With dead ends: 44 [2018-12-02 21:30:27,578 INFO L226 Difference]: Without dead ends: 33 [2018-12-02 21:30:27,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-02 21:30:27,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-02 21:30:27,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-02 21:30:27,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 21:30:27,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-12-02 21:30:27,580 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 21 [2018-12-02 21:30:27,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:30:27,580 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-12-02 21:30:27,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 21:30:27,580 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-12-02 21:30:27,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 21:30:27,580 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:30:27,580 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:30:27,581 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 21:30:27,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:30:27,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1606829079, now seen corresponding path program 1 times [2018-12-02 21:30:27,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:30:27,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:30:27,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:27,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:30:27,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:27,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:27,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:30:27,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 21:30:27,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 21:30:27,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 21:30:27,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-02 21:30:27,652 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 10 states. [2018-12-02 21:30:27,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:30:27,715 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-12-02 21:30:27,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 21:30:27,715 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-12-02 21:30:27,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:30:27,715 INFO L225 Difference]: With dead ends: 51 [2018-12-02 21:30:27,716 INFO L226 Difference]: Without dead ends: 51 [2018-12-02 21:30:27,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-12-02 21:30:27,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-02 21:30:27,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2018-12-02 21:30:27,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 21:30:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-12-02 21:30:27,719 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 21 [2018-12-02 21:30:27,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:30:27,719 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-12-02 21:30:27,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 21:30:27,719 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-12-02 21:30:27,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 21:30:27,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:30:27,720 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:30:27,720 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 21:30:27,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:30:27,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1408274539, now seen corresponding path program 1 times [2018-12-02 21:30:27,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:30:27,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:30:27,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:27,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:30:27,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:27,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:27,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:30:27,845 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82096b7f-7dec-44d3-818d-082aa16043fa/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:30:27,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:30:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:27,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:30:27,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-02 21:30:27,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-02 21:30:27,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:30:27,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:30:27,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:30:27,936 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-02 21:30:28,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 21:30:28,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 21:30:28,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 21:30:28,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:30:28,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:30:28,085 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-12-02 21:30:28,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:28,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:30:28,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2018-12-02 21:30:28,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 21:30:28,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 21:30:28,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-12-02 21:30:28,134 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 18 states. [2018-12-02 21:30:30,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:30:30,898 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-12-02 21:30:30,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 21:30:30,898 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-12-02 21:30:30,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:30:30,898 INFO L225 Difference]: With dead ends: 50 [2018-12-02 21:30:30,898 INFO L226 Difference]: Without dead ends: 50 [2018-12-02 21:30:30,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2018-12-02 21:30:30,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-02 21:30:30,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-12-02 21:30:30,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-02 21:30:30,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-12-02 21:30:30,900 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 21 [2018-12-02 21:30:30,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:30:30,901 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-12-02 21:30:30,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 21:30:30,901 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-12-02 21:30:30,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 21:30:30,901 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:30:30,901 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:30:30,901 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 21:30:30,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:30:30,901 INFO L82 PathProgramCache]: Analyzing trace with hash 706837704, now seen corresponding path program 1 times [2018-12-02 21:30:30,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:30:30,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:30:30,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:30,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:30:30,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:30,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:30,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:30:30,994 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82096b7f-7dec-44d3-818d-082aa16043fa/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:30:31,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:30:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:31,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:30:31,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 21:30:31,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:30:31,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-02 21:30:31,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 21:30:31,031 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:30:31,035 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:30:31,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:30:31,040 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-12-02 21:30:31,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:31,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:30:31,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-12-02 21:30:31,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 21:30:31,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 21:30:31,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2018-12-02 21:30:31,194 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 21 states. [2018-12-02 21:30:31,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:30:31,518 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-12-02 21:30:31,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 21:30:31,518 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 22 [2018-12-02 21:30:31,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:30:31,518 INFO L225 Difference]: With dead ends: 49 [2018-12-02 21:30:31,518 INFO L226 Difference]: Without dead ends: 49 [2018-12-02 21:30:31,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2018-12-02 21:30:31,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-02 21:30:31,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-12-02 21:30:31,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-02 21:30:31,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-12-02 21:30:31,521 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 22 [2018-12-02 21:30:31,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:30:31,521 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-12-02 21:30:31,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 21:30:31,521 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-12-02 21:30:31,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 21:30:31,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:30:31,522 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:30:31,522 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 21:30:31,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:30:31,522 INFO L82 PathProgramCache]: Analyzing trace with hash -2142368762, now seen corresponding path program 1 times [2018-12-02 21:30:31,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:30:31,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:30:31,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:31,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:30:31,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:31,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:31,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:30:31,689 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82096b7f-7dec-44d3-818d-082aa16043fa/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:30:31,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:30:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:31,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:30:31,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 21:30:31,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:30:31,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-02 21:30:31,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 21:30:31,730 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:30:31,734 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:30:31,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:30:31,737 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-12-02 21:30:31,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:31,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:30:31,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2018-12-02 21:30:31,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-02 21:30:31,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 21:30:31,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2018-12-02 21:30:31,881 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 20 states. [2018-12-02 21:30:32,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:30:32,363 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2018-12-02 21:30:32,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-02 21:30:32,363 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 24 [2018-12-02 21:30:32,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:30:32,364 INFO L225 Difference]: With dead ends: 57 [2018-12-02 21:30:32,364 INFO L226 Difference]: Without dead ends: 34 [2018-12-02 21:30:32,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=180, Invalid=1152, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 21:30:32,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-02 21:30:32,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-02 21:30:32,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-02 21:30:32,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-02 21:30:32,366 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 24 [2018-12-02 21:30:32,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:30:32,366 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-02 21:30:32,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-02 21:30:32,366 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-02 21:30:32,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 21:30:32,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:30:32,367 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:30:32,367 INFO L423 AbstractCegarLoop]: === Iteration 17 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 21:30:32,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:30:32,368 INFO L82 PathProgramCache]: Analyzing trace with hash 267592398, now seen corresponding path program 1 times [2018-12-02 21:30:32,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:30:32,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:30:32,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:32,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:30:32,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:32,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:32,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:30:32,492 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82096b7f-7dec-44d3-818d-082aa16043fa/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:30:32,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:30:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:32,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:30:32,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 21:30:32,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:30:32,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-02 21:30:32,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 21:30:32,534 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:30:32,537 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:30:32,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:30:32,541 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-12-02 21:30:32,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:32,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:30:32,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2018-12-02 21:30:32,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-02 21:30:32,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 21:30:32,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2018-12-02 21:30:32,686 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 20 states. [2018-12-02 21:30:33,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:30:33,202 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-02 21:30:33,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 21:30:33,202 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2018-12-02 21:30:33,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:30:33,202 INFO L225 Difference]: With dead ends: 38 [2018-12-02 21:30:33,202 INFO L226 Difference]: Without dead ends: 32 [2018-12-02 21:30:33,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=160, Invalid=1100, Unknown=0, NotChecked=0, Total=1260 [2018-12-02 21:30:33,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-02 21:30:33,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-12-02 21:30:33,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-02 21:30:33,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-02 21:30:33,204 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 26 [2018-12-02 21:30:33,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:30:33,204 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-02 21:30:33,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-02 21:30:33,204 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-02 21:30:33,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 21:30:33,204 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:30:33,204 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:30:33,204 INFO L423 AbstractCegarLoop]: === Iteration 18 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 21:30:33,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:30:33,205 INFO L82 PathProgramCache]: Analyzing trace with hash -276531991, now seen corresponding path program 2 times [2018-12-02 21:30:33,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:30:33,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:30:33,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:33,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:30:33,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:33,428 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:33,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:30:33,428 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82096b7f-7dec-44d3-818d-082aa16043fa/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:30:33,434 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 21:30:33,452 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 21:30:33,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:30:33,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:30:33,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 21:30:33,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:30:33,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-02 21:30:33,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 21:30:33,469 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:30:33,478 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:30:33,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:30:33,483 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2018-12-02 21:30:33,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 21:30:33,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-02 21:30:33,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:30:33,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:30:33,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:30:33,512 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-12-02 21:30:33,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-12-02 21:30:33,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 21:30:33,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:30:33,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:30:33,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:30:33,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-12-02 21:30:33,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-12-02 21:30:33,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-12-02 21:30:33,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 21:30:33,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:30:33,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:30:33,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-12-02 21:30:33,765 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:33,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:30:33,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-12-02 21:30:33,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-02 21:30:33,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-02 21:30:33,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=499, Unknown=0, NotChecked=0, Total=552 [2018-12-02 21:30:33,781 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 24 states. [2018-12-02 21:30:34,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:30:34,405 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-02 21:30:34,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 21:30:34,405 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 27 [2018-12-02 21:30:34,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:30:34,406 INFO L225 Difference]: With dead ends: 30 [2018-12-02 21:30:34,406 INFO L226 Difference]: Without dead ends: 30 [2018-12-02 21:30:34,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=163, Invalid=1169, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 21:30:34,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-02 21:30:34,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-12-02 21:30:34,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-02 21:30:34,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-02 21:30:34,407 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-12-02 21:30:34,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:30:34,407 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-02 21:30:34,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-02 21:30:34,407 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-02 21:30:34,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 21:30:34,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:30:34,408 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:30:34,408 INFO L423 AbstractCegarLoop]: === Iteration 19 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 21:30:34,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:30:34,408 INFO L82 PathProgramCache]: Analyzing trace with hash 17442826, now seen corresponding path program 2 times [2018-12-02 21:30:34,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:30:34,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:30:34,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:34,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:30:34,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:34,545 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:34,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:30:34,545 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82096b7f-7dec-44d3-818d-082aa16043fa/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:30:34,551 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 21:30:34,568 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 21:30:34,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:30:34,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:30:34,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 21:30:34,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:30:34,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-02 21:30:34,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 21:30:34,587 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:30:34,590 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:30:34,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:30:34,594 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-12-02 21:30:34,742 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:34,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:30:34,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2018-12-02 21:30:34,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-02 21:30:34,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-02 21:30:34,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-12-02 21:30:34,757 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 22 states. [2018-12-02 21:30:35,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:30:35,288 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-02 21:30:35,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 21:30:35,289 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2018-12-02 21:30:35,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:30:35,289 INFO L225 Difference]: With dead ends: 35 [2018-12-02 21:30:35,289 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 21:30:35,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=158, Invalid=1174, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 21:30:35,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 21:30:35,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 21:30:35,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 21:30:35,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 21:30:35,290 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-12-02 21:30:35,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:30:35,290 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 21:30:35,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-02 21:30:35,290 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 21:30:35,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 21:30:35,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 09:30:35 BoogieIcfgContainer [2018-12-02 21:30:35,293 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 21:30:35,294 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 21:30:35,294 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 21:30:35,294 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 21:30:35,294 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:30:25" (3/4) ... [2018-12-02 21:30:35,296 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 21:30:35,301 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrncpy [2018-12-02 21:30:35,301 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 21:30:35,301 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-12-02 21:30:35,301 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-12-02 21:30:35,302 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 21:30:35,304 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2018-12-02 21:30:35,305 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-02 21:30:35,305 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-02 21:30:35,330 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_82096b7f-7dec-44d3-818d-082aa16043fa/bin-2019/uautomizer/witness.graphml [2018-12-02 21:30:35,330 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 21:30:35,330 INFO L168 Benchmark]: Toolchain (without parser) took 9922.94 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 319.8 MB). Free memory was 951.7 MB in the beginning and 853.6 MB in the end (delta: 98.1 MB). Peak memory consumption was 417.9 MB. Max. memory is 11.5 GB. [2018-12-02 21:30:35,331 INFO L168 Benchmark]: CDTParser took 0.11 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-12-02 21:30:35,331 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -172.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-02 21:30:35,332 INFO L168 Benchmark]: Boogie Preprocessor took 28.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-02 21:30:35,332 INFO L168 Benchmark]: RCFGBuilder took 237.10 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: 42.1 MB). Peak memory consumption was 42.1 MB. Max. memory is 11.5 GB. [2018-12-02 21:30:35,332 INFO L168 Benchmark]: TraceAbstraction took 9367.83 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 183.5 MB). Free memory was 1.1 GB in the beginning and 861.6 MB in the end (delta: 216.8 MB). Peak memory consumption was 400.3 MB. Max. memory is 11.5 GB. [2018-12-02 21:30:35,332 INFO L168 Benchmark]: Witness Printer took 36.37 ms. Allocated memory is still 1.3 GB. Free memory was 861.6 MB in the beginning and 853.6 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-12-02 21:30:35,333 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.11 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 251.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -172.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 237.10 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: 42.1 MB). Peak memory consumption was 42.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9367.83 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 183.5 MB). Free memory was 1.1 GB in the beginning and 861.6 MB in the end (delta: 216.8 MB). Peak memory consumption was 400.3 MB. Max. memory is 11.5 GB. * Witness Printer took 36.37 ms. Allocated memory is still 1.3 GB. Free memory was 861.6 MB in the beginning and 853.6 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 46 locations, 9 error locations. SAFE Result, 9.3s OverallTime, 19 OverallIterations, 3 TraceHistogramMax, 6.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 455 SDtfs, 674 SDslu, 2190 SDs, 0 SdLazy, 2185 SolverSat, 169 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 401 GetRequests, 110 SyntacticMatches, 9 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 60 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 516 NumberOfCodeBlocks, 516 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 491 ConstructedInterpolants, 21 QuantifiedInterpolants, 103417 SizeOfPredicates, 82 NumberOfNonLiveVariables, 976 ConjunctsInSsa, 290 ConjunctsInUnsatCore, 25 InterpolantComputations, 13 PerfectInterpolantSequences, 4/72 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...