./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/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_cb34f23e-0d47-40ef-a58a-6936bfd0594e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cb34f23e-0d47-40ef-a58a-6936bfd0594e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cb34f23e-0d47-40ef-a58a-6936bfd0594e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cb34f23e-0d47-40ef-a58a-6936bfd0594e/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_cb34f23e-0d47-40ef-a58a-6936bfd0594e/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cb34f23e-0d47-40ef-a58a-6936bfd0594e/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 a42c021ebd0de645918b065980a1f8d912cba85d ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 03:44:00,902 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 03:44:00,903 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 03:44:00,909 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 03:44:00,909 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 03:44:00,910 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 03:44:00,910 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 03:44:00,911 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 03:44:00,912 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 03:44:00,912 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 03:44:00,913 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 03:44:00,913 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 03:44:00,913 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 03:44:00,914 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 03:44:00,914 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 03:44:00,915 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 03:44:00,915 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 03:44:00,916 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 03:44:00,917 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 03:44:00,917 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 03:44:00,918 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 03:44:00,918 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 03:44:00,919 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 03:44:00,920 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 03:44:00,920 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 03:44:00,920 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 03:44:00,921 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 03:44:00,921 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 03:44:00,921 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 03:44:00,922 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 03:44:00,922 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 03:44:00,922 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 03:44:00,922 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 03:44:00,923 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 03:44:00,923 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 03:44:00,923 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 03:44:00,923 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cb34f23e-0d47-40ef-a58a-6936bfd0594e/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-02 03:44:00,931 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 03:44:00,931 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 03:44:00,931 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 03:44:00,931 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 03:44:00,932 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 03:44:00,932 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 03:44:00,932 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 03:44:00,932 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 03:44:00,932 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 03:44:00,932 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 03:44:00,932 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 03:44:00,933 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 03:44:00,933 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 03:44:00,933 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 03:44:00,933 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 03:44:00,933 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 03:44:00,933 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 03:44:00,933 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 03:44:00,933 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 03:44:00,933 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 03:44:00,933 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 03:44:00,933 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 03:44:00,934 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 03:44:00,934 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 03:44:00,934 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 03:44:00,934 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 03:44:00,934 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 03:44:00,934 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 03:44:00,934 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_cb34f23e-0d47-40ef-a58a-6936bfd0594e/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 -> a42c021ebd0de645918b065980a1f8d912cba85d [2018-12-02 03:44:00,952 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 03:44:00,961 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 03:44:00,963 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 03:44:00,965 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 03:44:00,965 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 03:44:00,965 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cb34f23e-0d47-40ef-a58a-6936bfd0594e/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-12-02 03:44:01,011 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cb34f23e-0d47-40ef-a58a-6936bfd0594e/bin-2019/uautomizer/data/1d61be9aa/d66ae65ccbaa48a684d18bd645fb82c2/FLAGc62e859a0 [2018-12-02 03:44:01,334 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 03:44:01,334 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cb34f23e-0d47-40ef-a58a-6936bfd0594e/sv-benchmarks/c/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-12-02 03:44:01,341 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cb34f23e-0d47-40ef-a58a-6936bfd0594e/bin-2019/uautomizer/data/1d61be9aa/d66ae65ccbaa48a684d18bd645fb82c2/FLAGc62e859a0 [2018-12-02 03:44:01,350 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cb34f23e-0d47-40ef-a58a-6936bfd0594e/bin-2019/uautomizer/data/1d61be9aa/d66ae65ccbaa48a684d18bd645fb82c2 [2018-12-02 03:44:01,352 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 03:44:01,353 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-02 03:44:01,354 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 03:44:01,354 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 03:44:01,357 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 03:44:01,357 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:44:01" (1/1) ... [2018-12-02 03:44:01,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@178df10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:44:01, skipping insertion in model container [2018-12-02 03:44:01,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:44:01" (1/1) ... [2018-12-02 03:44:01,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 03:44:01,386 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 03:44:01,530 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 03:44:01,570 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 03:44:01,592 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 03:44:01,611 INFO L195 MainTranslator]: Completed translation [2018-12-02 03:44:01,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:44:01 WrapperNode [2018-12-02 03:44:01,612 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 03:44:01,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 03:44:01,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 03:44:01,613 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 03:44:01,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:44:01" (1/1) ... [2018-12-02 03:44:01,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:44:01" (1/1) ... [2018-12-02 03:44:01,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:44:01" (1/1) ... [2018-12-02 03:44:01,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:44:01" (1/1) ... [2018-12-02 03:44:01,633 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:44:01" (1/1) ... [2018-12-02 03:44:01,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:44:01" (1/1) ... [2018-12-02 03:44:01,637 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:44:01" (1/1) ... [2018-12-02 03:44:01,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 03:44:01,640 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 03:44:01,640 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 03:44:01,640 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 03:44:01,641 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:44:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cb34f23e-0d47-40ef-a58a-6936bfd0594e/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 03:44:01,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 03:44:01,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 03:44:01,671 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-02 03:44:01,671 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-02 03:44:01,671 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrncpy [2018-12-02 03:44:01,671 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 03:44:01,671 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-02 03:44:01,671 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-02 03:44:01,671 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-02 03:44:01,671 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-02 03:44:01,671 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-02 03:44:01,671 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-02 03:44:01,671 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-02 03:44:01,672 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-02 03:44:01,672 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-02 03:44:01,672 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-02 03:44:01,672 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-02 03:44:01,672 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-02 03:44:01,672 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-02 03:44:01,672 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-02 03:44:01,672 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-02 03:44:01,672 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-02 03:44:01,672 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-02 03:44:01,672 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-02 03:44:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-02 03:44:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-02 03:44:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-02 03:44:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-02 03:44:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-02 03:44:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-02 03:44:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-02 03:44:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-02 03:44:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-02 03:44:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-02 03:44:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-02 03:44:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-02 03:44:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-02 03:44:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-02 03:44:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-02 03:44:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-02 03:44:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-02 03:44:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-02 03:44:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-02 03:44:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-02 03:44:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-02 03:44:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-02 03:44:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-02 03:44:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-02 03:44:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-02 03:44:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-02 03:44:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-02 03:44:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-02 03:44:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-02 03:44:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-02 03:44:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-02 03:44:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-02 03:44:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-02 03:44:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-02 03:44:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-02 03:44:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-02 03:44:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-02 03:44:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-02 03:44:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-02 03:44:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-02 03:44:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-02 03:44:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-02 03:44:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-02 03:44:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-02 03:44:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-02 03:44:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-02 03:44:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-02 03:44:01,676 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-02 03:44:01,676 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-02 03:44:01,676 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-02 03:44:01,676 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-02 03:44:01,676 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-02 03:44:01,676 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-02 03:44:01,676 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-02 03:44:01,676 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-02 03:44:01,676 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-02 03:44:01,676 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-02 03:44:01,676 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-02 03:44:01,676 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-02 03:44:01,676 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-02 03:44:01,676 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-02 03:44:01,676 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-02 03:44:01,676 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-02 03:44:01,676 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-02 03:44:01,677 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-02 03:44:01,677 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-02 03:44:01,677 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-02 03:44:01,677 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-02 03:44:01,677 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-02 03:44:01,677 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-02 03:44:01,677 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-02 03:44:01,677 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-02 03:44:01,677 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-02 03:44:01,677 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-02 03:44:01,677 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-02 03:44:01,677 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-02 03:44:01,677 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-02 03:44:01,677 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-02 03:44:01,677 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-02 03:44:01,677 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-02 03:44:01,678 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-02 03:44:01,678 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-02 03:44:01,678 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-02 03:44:01,678 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-02 03:44:01,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-02 03:44:01,678 INFO L130 BoogieDeclarations]: Found specification of procedure cstrncpy [2018-12-02 03:44:01,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 03:44:01,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 03:44:01,678 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 03:44:01,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 03:44:01,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 03:44:01,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 03:44:01,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 03:44:01,876 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 03:44:01,876 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 03:44:01,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:44:01 BoogieIcfgContainer [2018-12-02 03:44:01,876 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 03:44:01,877 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 03:44:01,877 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 03:44:01,879 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 03:44:01,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:44:01" (1/3) ... [2018-12-02 03:44:01,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11aba475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:44:01, skipping insertion in model container [2018-12-02 03:44:01,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:44:01" (2/3) ... [2018-12-02 03:44:01,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11aba475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:44:01, skipping insertion in model container [2018-12-02 03:44:01,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:44:01" (3/3) ... [2018-12-02 03:44:01,880 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-12-02 03:44:01,886 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 03:44:01,890 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-12-02 03:44:01,899 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-12-02 03:44:01,913 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 03:44:01,914 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 03:44:01,914 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 03:44:01,914 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 03:44:01,914 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 03:44:01,914 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 03:44:01,914 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 03:44:01,914 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 03:44:01,914 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 03:44:01,922 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-12-02 03:44:01,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 03:44:01,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:44:01,928 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:44:01,929 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 03:44:01,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:44:01,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1056841845, now seen corresponding path program 1 times [2018-12-02 03:44:01,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:44:01,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:44:01,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:44:01,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:44:01,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:44:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:44:02,022 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 03:44:02,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:44:02,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 03:44:02,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 03:44:02,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:44:02,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:44:02,035 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2018-12-02 03:44:02,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:44:02,061 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-12-02 03:44:02,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:44:02,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 03:44:02,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:44:02,067 INFO L225 Difference]: With dead ends: 36 [2018-12-02 03:44:02,067 INFO L226 Difference]: Without dead ends: 33 [2018-12-02 03:44:02,068 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 03:44:02,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-02 03:44:02,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-02 03:44:02,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 03:44:02,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-12-02 03:44:02,088 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 10 [2018-12-02 03:44:02,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:44:02,088 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-12-02 03:44:02,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 03:44:02,088 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-12-02 03:44:02,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 03:44:02,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:44:02,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:44:02,089 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 03:44:02,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:44:02,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1056841844, now seen corresponding path program 1 times [2018-12-02 03:44:02,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:44:02,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:44:02,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:44:02,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:44:02,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:44:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:44:02,120 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 03:44:02,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:44:02,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:44:02,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:44:02,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:44:02,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:44:02,121 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2018-12-02 03:44:02,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:44:02,133 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-12-02 03:44:02,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:44:02,133 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-02 03:44:02,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:44:02,134 INFO L225 Difference]: With dead ends: 32 [2018-12-02 03:44:02,134 INFO L226 Difference]: Without dead ends: 32 [2018-12-02 03:44:02,134 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 03:44:02,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-02 03:44:02,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-02 03:44:02,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-02 03:44:02,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-12-02 03:44:02,136 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 10 [2018-12-02 03:44:02,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:44:02,137 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-12-02 03:44:02,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:44:02,137 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-12-02 03:44:02,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 03:44:02,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:44:02,137 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:44:02,137 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 03:44:02,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:44:02,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1498133944, now seen corresponding path program 1 times [2018-12-02 03:44:02,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:44:02,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:44:02,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:44:02,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:44:02,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:44:02,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:44:02,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 03:44:02,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:44:02,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 03:44:02,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 03:44:02,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 03:44:02,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:44:02,204 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 8 states. [2018-12-02 03:44:02,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:44:02,270 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-12-02 03:44:02,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 03:44:02,271 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-12-02 03:44:02,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:44:02,273 INFO L225 Difference]: With dead ends: 42 [2018-12-02 03:44:02,273 INFO L226 Difference]: Without dead ends: 42 [2018-12-02 03:44:02,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-02 03:44:02,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-02 03:44:02,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2018-12-02 03:44:02,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-02 03:44:02,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2018-12-02 03:44:02,278 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 14 [2018-12-02 03:44:02,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:44:02,278 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-12-02 03:44:02,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 03:44:02,278 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-12-02 03:44:02,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 03:44:02,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:44:02,279 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:44:02,279 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 03:44:02,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:44:02,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1498133945, now seen corresponding path program 1 times [2018-12-02 03:44:02,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:44:02,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:44:02,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:44:02,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:44:02,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:44:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:44:02,324 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 03:44:02,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:44:02,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:44:02,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:44:02,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:44:02,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:44:02,325 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 6 states. [2018-12-02 03:44:02,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:44:02,364 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-12-02 03:44:02,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:44:02,365 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-12-02 03:44:02,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:44:02,365 INFO L225 Difference]: With dead ends: 33 [2018-12-02 03:44:02,365 INFO L226 Difference]: Without dead ends: 33 [2018-12-02 03:44:02,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:44:02,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-02 03:44:02,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-02 03:44:02,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 03:44:02,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-12-02 03:44:02,369 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 14 [2018-12-02 03:44:02,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:44:02,369 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-12-02 03:44:02,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:44:02,369 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-12-02 03:44:02,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 03:44:02,370 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:44:02,370 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:44:02,370 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 03:44:02,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:44:02,370 INFO L82 PathProgramCache]: Analyzing trace with hash 802487948, now seen corresponding path program 1 times [2018-12-02 03:44:02,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:44:02,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:44:02,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:44:02,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:44:02,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:44:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:44:02,431 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 03:44:02,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:44:02,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:44:02,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 03:44:02,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 03:44:02,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:44:02,432 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 7 states. [2018-12-02 03:44:02,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:44:02,479 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2018-12-02 03:44:02,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:44:02,479 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-02 03:44:02,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:44:02,480 INFO L225 Difference]: With dead ends: 32 [2018-12-02 03:44:02,480 INFO L226 Difference]: Without dead ends: 32 [2018-12-02 03:44:02,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-02 03:44:02,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-02 03:44:02,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-02 03:44:02,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-02 03:44:02,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-12-02 03:44:02,482 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 15 [2018-12-02 03:44:02,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:44:02,482 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-12-02 03:44:02,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 03:44:02,483 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-12-02 03:44:02,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 03:44:02,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:44:02,483 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:44:02,483 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 03:44:02,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:44:02,483 INFO L82 PathProgramCache]: Analyzing trace with hash 802487949, now seen corresponding path program 1 times [2018-12-02 03:44:02,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:44:02,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:44:02,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:44:02,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:44:02,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:44:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:44:02,527 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 03:44:02,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:44:02,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:44:02,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 03:44:02,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 03:44:02,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:44:02,528 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 7 states. [2018-12-02 03:44:02,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:44:02,581 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2018-12-02 03:44:02,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 03:44:02,581 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-02 03:44:02,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:44:02,581 INFO L225 Difference]: With dead ends: 37 [2018-12-02 03:44:02,581 INFO L226 Difference]: Without dead ends: 37 [2018-12-02 03:44:02,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-02 03:44:02,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-02 03:44:02,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-12-02 03:44:02,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 03:44:02,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-12-02 03:44:02,584 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 15 [2018-12-02 03:44:02,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:44:02,584 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-12-02 03:44:02,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 03:44:02,584 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-12-02 03:44:02,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 03:44:02,584 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:44:02,585 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 03:44:02,585 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 03:44:02,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:44:02,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1102767525, now seen corresponding path program 1 times [2018-12-02 03:44:02,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:44:02,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:44:02,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:44:02,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:44:02,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:44:02,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:44:02,604 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 03:44:02,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:44:02,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:44:02,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:44:02,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:44:02,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:44:02,605 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 5 states. [2018-12-02 03:44:02,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:44:02,619 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-12-02 03:44:02,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:44:02,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-02 03:44:02,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:44:02,620 INFO L225 Difference]: With dead ends: 36 [2018-12-02 03:44:02,620 INFO L226 Difference]: Without dead ends: 33 [2018-12-02 03:44:02,620 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 03:44:02,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-02 03:44:02,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-02 03:44:02,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 03:44:02,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-12-02 03:44:02,622 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 18 [2018-12-02 03:44:02,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:44:02,622 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-12-02 03:44:02,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:44:02,622 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-12-02 03:44:02,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 03:44:02,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:44:02,622 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:44:02,623 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 03:44:02,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:44:02,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1130499361, now seen corresponding path program 1 times [2018-12-02 03:44:02,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:44:02,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:44:02,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:44:02,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:44:02,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:44:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:44:02,648 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 03:44:02,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:44:02,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:44:02,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:44:02,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:44:02,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:44:02,649 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 6 states. [2018-12-02 03:44:02,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:44:02,675 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-12-02 03:44:02,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 03:44:02,675 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-12-02 03:44:02,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:44:02,676 INFO L225 Difference]: With dead ends: 57 [2018-12-02 03:44:02,676 INFO L226 Difference]: Without dead ends: 57 [2018-12-02 03:44:02,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:44:02,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-02 03:44:02,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2018-12-02 03:44:02,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-02 03:44:02,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-12-02 03:44:02,681 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 18 [2018-12-02 03:44:02,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:44:02,681 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-12-02 03:44:02,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:44:02,682 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-12-02 03:44:02,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 03:44:02,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:44:02,682 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:44:02,683 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 03:44:02,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:44:02,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1831563939, now seen corresponding path program 1 times [2018-12-02 03:44:02,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:44:02,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:44:02,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:44:02,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:44:02,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:44:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:44:02,778 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 03:44:02,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:44:02,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 03:44:02,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 03:44:02,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 03:44:02,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 03:44:02,779 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 9 states. [2018-12-02 03:44:02,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:44:02,851 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2018-12-02 03:44:02,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 03:44:02,851 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-12-02 03:44:02,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:44:02,852 INFO L225 Difference]: With dead ends: 85 [2018-12-02 03:44:02,852 INFO L226 Difference]: Without dead ends: 85 [2018-12-02 03:44:02,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-12-02 03:44:02,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-02 03:44:02,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 65. [2018-12-02 03:44:02,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-02 03:44:02,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2018-12-02 03:44:02,856 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 18 [2018-12-02 03:44:02,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:44:02,857 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2018-12-02 03:44:02,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 03:44:02,857 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2018-12-02 03:44:02,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 03:44:02,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:44:02,858 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:44:02,858 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 03:44:02,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:44:02,858 INFO L82 PathProgramCache]: Analyzing trace with hash 2089729377, now seen corresponding path program 1 times [2018-12-02 03:44:02,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:44:02,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:44:02,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:44:02,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:44:02,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:44:02,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:44:02,993 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 03:44:02,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:44:02,994 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cb34f23e-0d47-40ef-a58a-6936bfd0594e/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 03:44:03,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:44:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:44:03,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:44:03,058 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 03:44:03,059 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 03:44:03,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:44:03,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:44:03,067 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 03:44:03,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-02 03:44:03,154 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 03:44:03,160 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 03:44:03,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 03:44:03,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 03:44:03,171 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 03:44:03,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-12-02 03:44:03,200 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 03:44:03,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 03:44:03,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2018-12-02 03:44:03,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 03:44:03,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 03:44:03,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-12-02 03:44:03,215 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand 16 states. [2018-12-02 03:44:03,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:44:03,502 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2018-12-02 03:44:03,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 03:44:03,502 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-12-02 03:44:03,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:44:03,503 INFO L225 Difference]: With dead ends: 77 [2018-12-02 03:44:03,503 INFO L226 Difference]: Without dead ends: 77 [2018-12-02 03:44:03,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2018-12-02 03:44:03,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-02 03:44:03,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 68. [2018-12-02 03:44:03,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-02 03:44:03,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2018-12-02 03:44:03,507 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 18 [2018-12-02 03:44:03,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:44:03,507 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2018-12-02 03:44:03,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 03:44:03,507 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2018-12-02 03:44:03,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 03:44:03,508 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:44:03,508 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:44:03,508 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 03:44:03,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:44:03,508 INFO L82 PathProgramCache]: Analyzing trace with hash 685189778, now seen corresponding path program 1 times [2018-12-02 03:44:03,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:44:03,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:44:03,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:44:03,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:44:03,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:44:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:44:03,537 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 03:44:03,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:44:03,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:44:03,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:44:03,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:44:03,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:44:03,538 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand 6 states. [2018-12-02 03:44:03,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:44:03,580 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2018-12-02 03:44:03,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 03:44:03,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-02 03:44:03,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:44:03,581 INFO L225 Difference]: With dead ends: 73 [2018-12-02 03:44:03,581 INFO L226 Difference]: Without dead ends: 73 [2018-12-02 03:44:03,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-02 03:44:03,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-02 03:44:03,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2018-12-02 03:44:03,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-02 03:44:03,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2018-12-02 03:44:03,584 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 19 [2018-12-02 03:44:03,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:44:03,584 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2018-12-02 03:44:03,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:44:03,584 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2018-12-02 03:44:03,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 03:44:03,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:44:03,585 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:44:03,585 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 03:44:03,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:44:03,585 INFO L82 PathProgramCache]: Analyzing trace with hash 685189779, now seen corresponding path program 1 times [2018-12-02 03:44:03,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:44:03,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:44:03,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:44:03,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:44:03,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:44:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:44:03,636 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 03:44:03,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:44:03,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 03:44:03,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 03:44:03,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 03:44:03,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:44:03,637 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand 8 states. [2018-12-02 03:44:03,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:44:03,707 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2018-12-02 03:44:03,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 03:44:03,707 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-12-02 03:44:03,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:44:03,708 INFO L225 Difference]: With dead ends: 81 [2018-12-02 03:44:03,708 INFO L226 Difference]: Without dead ends: 81 [2018-12-02 03:44:03,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-12-02 03:44:03,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-02 03:44:03,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2018-12-02 03:44:03,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-02 03:44:03,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2018-12-02 03:44:03,712 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 19 [2018-12-02 03:44:03,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:44:03,713 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2018-12-02 03:44:03,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 03:44:03,713 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2018-12-02 03:44:03,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 03:44:03,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:44:03,714 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:44:03,714 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 03:44:03,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:44:03,714 INFO L82 PathProgramCache]: Analyzing trace with hash 943355217, now seen corresponding path program 1 times [2018-12-02 03:44:03,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:44:03,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:44:03,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:44:03,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:44:03,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:44:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:44:03,830 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 03:44:03,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:44:03,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 03:44:03,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 03:44:03,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 03:44:03,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-12-02 03:44:03,831 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 12 states. [2018-12-02 03:44:04,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:44:04,039 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2018-12-02 03:44:04,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 03:44:04,039 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-12-02 03:44:04,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:44:04,040 INFO L225 Difference]: With dead ends: 89 [2018-12-02 03:44:04,040 INFO L226 Difference]: Without dead ends: 89 [2018-12-02 03:44:04,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-12-02 03:44:04,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-02 03:44:04,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2018-12-02 03:44:04,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-02 03:44:04,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2018-12-02 03:44:04,042 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 19 [2018-12-02 03:44:04,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:44:04,042 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2018-12-02 03:44:04,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 03:44:04,043 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2018-12-02 03:44:04,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 03:44:04,043 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:44:04,043 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:44:04,043 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 03:44:04,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:44:04,043 INFO L82 PathProgramCache]: Analyzing trace with hash 357101204, now seen corresponding path program 1 times [2018-12-02 03:44:04,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:44:04,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:44:04,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:44:04,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:44:04,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:44:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:44:04,094 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 03:44:04,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:44:04,095 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cb34f23e-0d47-40ef-a58a-6936bfd0594e/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 03:44:04,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:44:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:44:04,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:44:04,125 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 03:44:04,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 03:44:04,128 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 03:44:04,131 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 03:44:04,131 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 03:44:04,134 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:44:04,139 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 03:44:04,139 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-12-02 03:44:04,197 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 03:44:04,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 03:44:04,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-12-02 03:44:04,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 03:44:04,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 03:44:04,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-12-02 03:44:04,213 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand 14 states. [2018-12-02 03:44:04,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:44:04,351 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2018-12-02 03:44:04,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 03:44:04,352 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 19 [2018-12-02 03:44:04,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:44:04,352 INFO L225 Difference]: With dead ends: 96 [2018-12-02 03:44:04,352 INFO L226 Difference]: Without dead ends: 96 [2018-12-02 03:44:04,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2018-12-02 03:44:04,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-02 03:44:04,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 83. [2018-12-02 03:44:04,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-02 03:44:04,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2018-12-02 03:44:04,356 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 19 [2018-12-02 03:44:04,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:44:04,356 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2018-12-02 03:44:04,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 03:44:04,356 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2018-12-02 03:44:04,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 03:44:04,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:44:04,357 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, 1, 1] [2018-12-02 03:44:04,357 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 03:44:04,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:44:04,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1020088252, now seen corresponding path program 1 times [2018-12-02 03:44:04,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:44:04,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:44:04,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:44:04,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:44:04,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:44:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:44:04,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 03:44:04,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:44:04,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:44:04,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:44:04,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:44:04,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:44:04,391 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. Second operand 4 states. [2018-12-02 03:44:04,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:44:04,416 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2018-12-02 03:44:04,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:44:04,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-12-02 03:44:04,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:44:04,417 INFO L225 Difference]: With dead ends: 82 [2018-12-02 03:44:04,417 INFO L226 Difference]: Without dead ends: 47 [2018-12-02 03:44:04,417 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 03:44:04,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-02 03:44:04,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2018-12-02 03:44:04,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-02 03:44:04,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-12-02 03:44:04,419 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 22 [2018-12-02 03:44:04,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:44:04,419 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-12-02 03:44:04,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:44:04,419 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-12-02 03:44:04,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 03:44:04,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:44:04,419 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:44:04,419 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 03:44:04,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:44:04,419 INFO L82 PathProgramCache]: Analyzing trace with hash -232043590, now seen corresponding path program 2 times [2018-12-02 03:44:04,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:44:04,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:44:04,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:44:04,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:44:04,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:44:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:44:04,653 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:44:04,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:44:04,653 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cb34f23e-0d47-40ef-a58a-6936bfd0594e/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 03:44:04,659 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 03:44:04,673 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 03:44:04,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 03:44:04,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:44:04,684 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 03:44:04,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 03:44:04,687 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 03:44:04,690 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 03:44:04,690 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 03:44:04,693 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:44:04,696 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 03:44:04,696 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2018-12-02 03:44:04,712 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 03:44:04,714 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 03:44:04,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:44:04,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:44:04,720 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 03:44:04,720 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-12-02 03:44:04,821 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 03:44:04,823 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 03:44:04,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:44:04,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:44:04,832 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 03:44:04,832 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-12-02 03:44:04,881 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 03:44:04,886 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 03:44:04,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 03:44:04,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 03:44:04,895 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 03:44:04,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-12-02 03:44:04,931 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:44:04,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 03:44:04,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-12-02 03:44:04,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-02 03:44:04,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-02 03:44:04,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2018-12-02 03:44:04,947 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 22 states. [2018-12-02 03:44:05,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:44:05,698 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-12-02 03:44:05,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 03:44:05,698 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-12-02 03:44:05,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:44:05,699 INFO L225 Difference]: With dead ends: 49 [2018-12-02 03:44:05,699 INFO L226 Difference]: Without dead ends: 49 [2018-12-02 03:44:05,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=158, Invalid=1032, Unknown=0, NotChecked=0, Total=1190 [2018-12-02 03:44:05,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-02 03:44:05,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2018-12-02 03:44:05,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 03:44:05,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-12-02 03:44:05,701 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 22 [2018-12-02 03:44:05,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:44:05,701 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-12-02 03:44:05,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-02 03:44:05,702 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-12-02 03:44:05,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 03:44:05,702 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:44:05,702 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] [2018-12-02 03:44:05,702 INFO L423 AbstractCegarLoop]: === Iteration 17 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 03:44:05,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:44:05,702 INFO L82 PathProgramCache]: Analyzing trace with hash 6421641, now seen corresponding path program 1 times [2018-12-02 03:44:05,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:44:05,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:44:05,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:44:05,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:44:05,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:44:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:44:05,815 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 03:44:05,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:44:05,816 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cb34f23e-0d47-40ef-a58a-6936bfd0594e/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 03:44:05,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:44:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:44:05,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:44:05,855 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 03:44:05,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 03:44:05,860 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 03:44:05,862 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 03:44:05,862 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 03:44:05,865 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:44:05,869 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 03:44:05,870 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-12-02 03:44:06,035 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 03:44:06,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 03:44:06,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-12-02 03:44:06,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-02 03:44:06,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-02 03:44:06,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=456, Unknown=0, NotChecked=0, Total=506 [2018-12-02 03:44:06,051 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 23 states. [2018-12-02 03:44:06,863 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2018-12-02 03:44:07,515 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2018-12-02 03:44:07,694 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2018-12-02 03:44:07,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:44:07,703 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-12-02 03:44:07,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-02 03:44:07,704 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-12-02 03:44:07,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:44:07,705 INFO L225 Difference]: With dead ends: 50 [2018-12-02 03:44:07,705 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 03:44:07,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=275, Invalid=1531, Unknown=0, NotChecked=0, Total=1806 [2018-12-02 03:44:07,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 03:44:07,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 03:44:07,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 03:44:07,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 03:44:07,709 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-12-02 03:44:07,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:44:07,709 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 03:44:07,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-02 03:44:07,710 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 03:44:07,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 03:44:07,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:44:07 BoogieIcfgContainer [2018-12-02 03:44:07,719 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 03:44:07,720 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 03:44:07,720 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 03:44:07,720 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 03:44:07,720 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:44:01" (3/4) ... [2018-12-02 03:44:07,724 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 03:44:07,730 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrncpy [2018-12-02 03:44:07,730 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 03:44:07,731 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-12-02 03:44:07,731 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-12-02 03:44:07,731 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 03:44:07,734 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2018-12-02 03:44:07,735 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-02 03:44:07,735 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-02 03:44:07,762 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_cb34f23e-0d47-40ef-a58a-6936bfd0594e/bin-2019/uautomizer/witness.graphml [2018-12-02 03:44:07,762 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 03:44:07,762 INFO L168 Benchmark]: Toolchain (without parser) took 6409.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.8 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -175.2 MB). Peak memory consumption was 4.6 MB. Max. memory is 11.5 GB. [2018-12-02 03:44:07,763 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 03:44:07,763 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -154.3 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2018-12-02 03:44:07,763 INFO L168 Benchmark]: Boogie Preprocessor took 27.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 03:44:07,763 INFO L168 Benchmark]: RCFGBuilder took 236.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. [2018-12-02 03:44:07,763 INFO L168 Benchmark]: TraceAbstraction took 5842.42 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -73.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 03:44:07,764 INFO L168 Benchmark]: Witness Printer took 42.14 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: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2018-12-02 03:44:07,765 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 258.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -154.3 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 236.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5842.42 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -73.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 42.14 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: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 569]: 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, 43 locations, 9 error locations. SAFE Result, 5.8s OverallTime, 17 OverallIterations, 3 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 430 SDtfs, 547 SDslu, 1849 SDs, 0 SdLazy, 1516 SolverSat, 167 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 269 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=13, 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, 17 MinimizatonAttempts, 99 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 375 NumberOfCodeBlocks, 375 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 354 ConstructedInterpolants, 12 QuantifiedInterpolants, 48716 SizeOfPredicates, 57 NumberOfNonLiveVariables, 631 ConjunctsInSsa, 173 ConjunctsInUnsatCore, 21 InterpolantComputations, 13 PerfectInterpolantSequences, 5/37 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...