./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/lis_unsafe_false-valid-deref.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_4c166a9b-e749-4bb6-a3a2-261158dcee30/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4c166a9b-e749-4bb6-a3a2-261158dcee30/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4c166a9b-e749-4bb6-a3a2-261158dcee30/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4c166a9b-e749-4bb6-a3a2-261158dcee30/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/lis_unsafe_false-valid-deref.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4c166a9b-e749-4bb6-a3a2-261158dcee30/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4c166a9b-e749-4bb6-a3a2-261158dcee30/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 5b50a1ee99e08fd261bb9e6273225454d92c8178 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 20:12:32,701 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 20:12:32,702 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 20:12:32,707 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 20:12:32,708 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 20:12:32,708 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 20:12:32,709 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 20:12:32,709 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 20:12:32,710 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 20:12:32,710 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 20:12:32,711 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 20:12:32,711 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 20:12:32,711 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 20:12:32,712 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 20:12:32,712 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 20:12:32,713 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 20:12:32,713 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 20:12:32,714 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 20:12:32,715 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 20:12:32,715 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 20:12:32,716 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 20:12:32,716 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 20:12:32,717 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 20:12:32,717 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 20:12:32,718 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 20:12:32,718 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 20:12:32,718 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 20:12:32,719 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 20:12:32,719 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 20:12:32,720 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 20:12:32,720 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 20:12:32,720 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 20:12:32,720 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 20:12:32,720 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 20:12:32,721 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 20:12:32,721 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 20:12:32,721 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4c166a9b-e749-4bb6-a3a2-261158dcee30/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-02 20:12:32,728 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 20:12:32,728 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 20:12:32,729 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 20:12:32,729 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 20:12:32,729 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 20:12:32,729 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 20:12:32,729 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 20:12:32,729 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 20:12:32,730 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 20:12:32,730 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 20:12:32,730 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 20:12:32,730 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 20:12:32,730 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 20:12:32,730 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 20:12:32,730 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 20:12:32,730 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 20:12:32,730 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 20:12:32,730 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 20:12:32,730 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 20:12:32,730 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 20:12:32,731 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 20:12:32,731 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 20:12:32,731 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 20:12:32,731 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 20:12:32,731 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 20:12:32,731 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 20:12:32,731 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 20:12:32,731 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 20:12:32,731 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_4c166a9b-e749-4bb6-a3a2-261158dcee30/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 -> 5b50a1ee99e08fd261bb9e6273225454d92c8178 [2018-12-02 20:12:32,748 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 20:12:32,754 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 20:12:32,756 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 20:12:32,757 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 20:12:32,757 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 20:12:32,757 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4c166a9b-e749-4bb6-a3a2-261158dcee30/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/lis_unsafe_false-valid-deref.i [2018-12-02 20:12:32,792 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4c166a9b-e749-4bb6-a3a2-261158dcee30/bin-2019/uautomizer/data/7f1691e55/0d7fe65028564cada867ed7051c98282/FLAGcbe7cf9a3 [2018-12-02 20:12:33,263 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 20:12:33,263 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4c166a9b-e749-4bb6-a3a2-261158dcee30/sv-benchmarks/c/array-memsafety/lis_unsafe_false-valid-deref.i [2018-12-02 20:12:33,269 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4c166a9b-e749-4bb6-a3a2-261158dcee30/bin-2019/uautomizer/data/7f1691e55/0d7fe65028564cada867ed7051c98282/FLAGcbe7cf9a3 [2018-12-02 20:12:33,776 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4c166a9b-e749-4bb6-a3a2-261158dcee30/bin-2019/uautomizer/data/7f1691e55/0d7fe65028564cada867ed7051c98282 [2018-12-02 20:12:33,778 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 20:12:33,779 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-02 20:12:33,779 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 20:12:33,779 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 20:12:33,782 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 20:12:33,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:12:33" (1/1) ... [2018-12-02 20:12:33,784 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35e48869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:12:33, skipping insertion in model container [2018-12-02 20:12:33,784 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:12:33" (1/1) ... [2018-12-02 20:12:33,788 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 20:12:33,811 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 20:12:33,963 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 20:12:33,968 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 20:12:34,025 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 20:12:34,048 INFO L195 MainTranslator]: Completed translation [2018-12-02 20:12:34,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:12:34 WrapperNode [2018-12-02 20:12:34,049 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 20:12:34,049 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 20:12:34,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 20:12:34,049 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 20:12:34,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:12:34" (1/1) ... [2018-12-02 20:12:34,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:12:34" (1/1) ... [2018-12-02 20:12:34,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:12:34" (1/1) ... [2018-12-02 20:12:34,066 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:12:34" (1/1) ... [2018-12-02 20:12:34,073 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:12:34" (1/1) ... [2018-12-02 20:12:34,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:12:34" (1/1) ... [2018-12-02 20:12:34,078 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:12:34" (1/1) ... [2018-12-02 20:12:34,081 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 20:12:34,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 20:12:34,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 20:12:34,081 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 20:12:34,081 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:12:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c166a9b-e749-4bb6-a3a2-261158dcee30/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 20:12:34,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 20:12:34,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 20:12:34,112 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-02 20:12:34,112 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-02 20:12:34,113 INFO L138 BoogieDeclarations]: Found implementation of procedure lis [2018-12-02 20:12:34,113 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 20:12:34,113 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-02 20:12:34,113 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-02 20:12:34,113 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-02 20:12:34,113 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-02 20:12:34,113 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-02 20:12:34,113 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-02 20:12:34,113 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-02 20:12:34,113 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-02 20:12:34,113 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-02 20:12:34,113 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-02 20:12:34,113 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-02 20:12:34,113 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-02 20:12:34,113 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-02 20:12:34,114 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-02 20:12:34,114 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-02 20:12:34,114 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-02 20:12:34,114 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-02 20:12:34,114 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-02 20:12:34,114 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-02 20:12:34,114 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-02 20:12:34,114 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-02 20:12:34,114 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-02 20:12:34,114 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-02 20:12:34,114 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-02 20:12:34,114 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-02 20:12:34,114 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-02 20:12:34,114 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-02 20:12:34,115 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-02 20:12:34,115 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-02 20:12:34,115 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-02 20:12:34,115 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-02 20:12:34,115 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-02 20:12:34,115 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-02 20:12:34,115 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-02 20:12:34,115 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-02 20:12:34,115 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-02 20:12:34,115 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-02 20:12:34,115 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-02 20:12:34,115 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-02 20:12:34,115 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-02 20:12:34,115 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-02 20:12:34,115 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-02 20:12:34,115 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-02 20:12:34,116 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-02 20:12:34,116 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-02 20:12:34,116 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-02 20:12:34,116 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-02 20:12:34,116 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-02 20:12:34,116 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-02 20:12:34,116 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-02 20:12:34,116 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-02 20:12:34,116 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-02 20:12:34,116 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-02 20:12:34,116 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-02 20:12:34,116 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-02 20:12:34,116 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-02 20:12:34,116 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-02 20:12:34,116 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-02 20:12:34,116 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-02 20:12:34,117 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-02 20:12:34,117 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-02 20:12:34,117 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-02 20:12:34,117 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-02 20:12:34,117 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-02 20:12:34,117 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-02 20:12:34,117 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-02 20:12:34,117 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-02 20:12:34,117 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-02 20:12:34,117 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-02 20:12:34,117 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-02 20:12:34,117 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-02 20:12:34,117 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-02 20:12:34,117 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-02 20:12:34,118 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-02 20:12:34,118 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-02 20:12:34,118 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-02 20:12:34,118 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-02 20:12:34,118 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-02 20:12:34,118 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-02 20:12:34,118 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-02 20:12:34,118 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-02 20:12:34,118 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-02 20:12:34,118 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-02 20:12:34,118 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-02 20:12:34,118 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-02 20:12:34,119 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-02 20:12:34,119 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-02 20:12:34,119 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-02 20:12:34,119 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-02 20:12:34,119 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-02 20:12:34,119 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-02 20:12:34,119 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-02 20:12:34,119 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-02 20:12:34,119 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-02 20:12:34,119 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-02 20:12:34,119 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-02 20:12:34,119 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-02 20:12:34,119 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-02 20:12:34,120 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-02 20:12:34,120 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-02 20:12:34,120 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-02 20:12:34,120 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-02 20:12:34,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-02 20:12:34,120 INFO L130 BoogieDeclarations]: Found specification of procedure lis [2018-12-02 20:12:34,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 20:12:34,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 20:12:34,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 20:12:34,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 20:12:34,120 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 20:12:34,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 20:12:34,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 20:12:34,356 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 20:12:34,357 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-02 20:12:34,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:12:34 BoogieIcfgContainer [2018-12-02 20:12:34,357 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 20:12:34,357 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 20:12:34,358 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 20:12:34,359 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 20:12:34,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:12:33" (1/3) ... [2018-12-02 20:12:34,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d14c490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:12:34, skipping insertion in model container [2018-12-02 20:12:34,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:12:34" (2/3) ... [2018-12-02 20:12:34,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d14c490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:12:34, skipping insertion in model container [2018-12-02 20:12:34,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:12:34" (3/3) ... [2018-12-02 20:12:34,361 INFO L112 eAbstractionObserver]: Analyzing ICFG lis_unsafe_false-valid-deref.i [2018-12-02 20:12:34,367 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 20:12:34,374 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-12-02 20:12:34,387 INFO L257 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2018-12-02 20:12:34,405 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 20:12:34,405 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 20:12:34,405 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 20:12:34,405 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 20:12:34,405 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 20:12:34,405 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 20:12:34,405 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 20:12:34,406 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 20:12:34,406 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 20:12:34,415 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2018-12-02 20:12:34,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 20:12:34,420 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:12:34,420 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:12:34,422 INFO L423 AbstractCegarLoop]: === Iteration 1 === [lisErr6REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr24ASSERT_VIOLATIONMEMORY_FREE, lisErr5REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr23ASSERT_VIOLATIONMEMORY_FREE, lisErr17REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr25ASSERT_VIOLATIONMEMORY_FREE, lisErr18REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr22ASSERT_VIOLATIONMEMORY_FREE, lisErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-02 20:12:34,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:12:34,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1269379464, now seen corresponding path program 1 times [2018-12-02 20:12:34,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:12:34,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:12:34,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:12:34,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:12:34,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:12:34,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:12:34,526 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 20:12:34,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:12:34,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 20:12:34,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:12:34,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:12:34,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:12:34,539 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 3 states. [2018-12-02 20:12:34,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:12:34,592 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2018-12-02 20:12:34,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:12:34,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 20:12:34,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:12:34,599 INFO L225 Difference]: With dead ends: 66 [2018-12-02 20:12:34,600 INFO L226 Difference]: Without dead ends: 63 [2018-12-02 20:12:34,601 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 20:12:34,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-02 20:12:34,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-02 20:12:34,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-02 20:12:34,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-12-02 20:12:34,625 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 10 [2018-12-02 20:12:34,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:12:34,625 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-12-02 20:12:34,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:12:34,625 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-12-02 20:12:34,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 20:12:34,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:12:34,626 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:12:34,626 INFO L423 AbstractCegarLoop]: === Iteration 2 === [lisErr6REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr24ASSERT_VIOLATIONMEMORY_FREE, lisErr5REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr23ASSERT_VIOLATIONMEMORY_FREE, lisErr17REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr25ASSERT_VIOLATIONMEMORY_FREE, lisErr18REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr22ASSERT_VIOLATIONMEMORY_FREE, lisErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-02 20:12:34,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:12:34,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1269379465, now seen corresponding path program 1 times [2018-12-02 20:12:34,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:12:34,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:12:34,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:12:34,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:12:34,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:12:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:12:34,673 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 20:12:34,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:12:34,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 20:12:34,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 20:12:34,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 20:12:34,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 20:12:34,674 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 4 states. [2018-12-02 20:12:34,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:12:34,748 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2018-12-02 20:12:34,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 20:12:34,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-02 20:12:34,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:12:34,749 INFO L225 Difference]: With dead ends: 70 [2018-12-02 20:12:34,749 INFO L226 Difference]: Without dead ends: 70 [2018-12-02 20:12:34,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:12:34,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-02 20:12:34,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2018-12-02 20:12:34,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-02 20:12:34,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2018-12-02 20:12:34,754 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 10 [2018-12-02 20:12:34,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:12:34,754 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2018-12-02 20:12:34,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 20:12:34,754 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2018-12-02 20:12:34,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 20:12:34,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:12:34,754 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:12:34,754 INFO L423 AbstractCegarLoop]: === Iteration 3 === [lisErr6REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr24ASSERT_VIOLATIONMEMORY_FREE, lisErr5REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr23ASSERT_VIOLATIONMEMORY_FREE, lisErr17REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr25ASSERT_VIOLATIONMEMORY_FREE, lisErr18REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr22ASSERT_VIOLATIONMEMORY_FREE, lisErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-02 20:12:34,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:12:34,755 INFO L82 PathProgramCache]: Analyzing trace with hash 696057711, now seen corresponding path program 1 times [2018-12-02 20:12:34,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:12:34,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:12:34,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:12:34,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:12:34,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:12:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:12:34,772 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 20:12:34,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:12:34,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 20:12:34,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:12:34,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:12:34,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:12:34,773 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 3 states. [2018-12-02 20:12:34,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:12:34,795 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2018-12-02 20:12:34,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:12:34,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-02 20:12:34,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:12:34,796 INFO L225 Difference]: With dead ends: 63 [2018-12-02 20:12:34,796 INFO L226 Difference]: Without dead ends: 63 [2018-12-02 20:12:34,796 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 20:12:34,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-02 20:12:34,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-02 20:12:34,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-02 20:12:34,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2018-12-02 20:12:34,799 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 11 [2018-12-02 20:12:34,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:12:34,799 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2018-12-02 20:12:34,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:12:34,799 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-12-02 20:12:34,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 20:12:34,799 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:12:34,800 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:12:34,800 INFO L423 AbstractCegarLoop]: === Iteration 4 === [lisErr6REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr24ASSERT_VIOLATIONMEMORY_FREE, lisErr5REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr23ASSERT_VIOLATIONMEMORY_FREE, lisErr17REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr25ASSERT_VIOLATIONMEMORY_FREE, lisErr18REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr22ASSERT_VIOLATIONMEMORY_FREE, lisErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-02 20:12:34,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:12:34,800 INFO L82 PathProgramCache]: Analyzing trace with hash 696057712, now seen corresponding path program 1 times [2018-12-02 20:12:34,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:12:34,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:12:34,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:12:34,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:12:34,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:12:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:12:34,836 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 20:12:34,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:12:34,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 20:12:34,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:12:34,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:12:34,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:12:34,837 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 5 states. [2018-12-02 20:12:34,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:12:34,931 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2018-12-02 20:12:34,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 20:12:34,931 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-12-02 20:12:34,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:12:34,932 INFO L225 Difference]: With dead ends: 77 [2018-12-02 20:12:34,932 INFO L226 Difference]: Without dead ends: 77 [2018-12-02 20:12:34,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 20:12:34,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-02 20:12:34,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 59. [2018-12-02 20:12:34,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-02 20:12:34,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2018-12-02 20:12:34,935 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 11 [2018-12-02 20:12:34,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:12:34,935 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2018-12-02 20:12:34,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:12:34,935 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-12-02 20:12:34,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 20:12:34,936 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:12:34,936 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:12:34,936 INFO L423 AbstractCegarLoop]: === Iteration 5 === [lisErr6REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr24ASSERT_VIOLATIONMEMORY_FREE, lisErr5REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr23ASSERT_VIOLATIONMEMORY_FREE, lisErr17REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr25ASSERT_VIOLATIONMEMORY_FREE, lisErr18REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr22ASSERT_VIOLATIONMEMORY_FREE, lisErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-02 20:12:34,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:12:34,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1104941388, now seen corresponding path program 1 times [2018-12-02 20:12:34,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:12:34,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:12:34,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:12:34,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:12:34,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:12:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:12:34,960 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 20:12:34,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:12:34,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 20:12:34,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:12:34,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:12:34,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:12:34,961 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 5 states. [2018-12-02 20:12:35,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:12:35,039 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2018-12-02 20:12:35,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 20:12:35,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-02 20:12:35,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:12:35,041 INFO L225 Difference]: With dead ends: 82 [2018-12-02 20:12:35,041 INFO L226 Difference]: Without dead ends: 82 [2018-12-02 20:12:35,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 20:12:35,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-02 20:12:35,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 65. [2018-12-02 20:12:35,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-02 20:12:35,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2018-12-02 20:12:35,045 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 13 [2018-12-02 20:12:35,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:12:35,045 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2018-12-02 20:12:35,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:12:35,045 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2018-12-02 20:12:35,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 20:12:35,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:12:35,045 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:12:35,046 INFO L423 AbstractCegarLoop]: === Iteration 6 === [lisErr6REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr24ASSERT_VIOLATIONMEMORY_FREE, lisErr5REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr23ASSERT_VIOLATIONMEMORY_FREE, lisErr17REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr25ASSERT_VIOLATIONMEMORY_FREE, lisErr18REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr22ASSERT_VIOLATIONMEMORY_FREE, lisErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-02 20:12:35,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:12:35,046 INFO L82 PathProgramCache]: Analyzing trace with hash 153158094, now seen corresponding path program 1 times [2018-12-02 20:12:35,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:12:35,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:12:35,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:12:35,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:12:35,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:12:35,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:12:35,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:12:35,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:12:35,087 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c166a9b-e749-4bb6-a3a2-261158dcee30/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 20:12:35,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:12:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:12:35,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:12:35,150 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 13 treesize of output 16 [2018-12-02 20:12:35,153 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 16 treesize of output 19 [2018-12-02 20:12:35,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 20:12:35,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:12:35,168 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 20:12:35,168 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 20:12:35,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 20:12:35,175 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:28, output treesize:25 [2018-12-02 20:12:35,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:12:35,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 20:12:35,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-12-02 20:12:35,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 20:12:35,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 20:12:35,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-02 20:12:35,253 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand 9 states. [2018-12-02 20:12:35,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:12:35,352 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2018-12-02 20:12:35,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 20:12:35,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2018-12-02 20:12:35,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:12:35,353 INFO L225 Difference]: With dead ends: 77 [2018-12-02 20:12:35,353 INFO L226 Difference]: Without dead ends: 77 [2018-12-02 20:12:35,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-02 20:12:35,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-02 20:12:35,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2018-12-02 20:12:35,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-02 20:12:35,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2018-12-02 20:12:35,356 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 14 [2018-12-02 20:12:35,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:12:35,356 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2018-12-02 20:12:35,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 20:12:35,357 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2018-12-02 20:12:35,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 20:12:35,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:12:35,357 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:12:35,357 INFO L423 AbstractCegarLoop]: === Iteration 7 === [lisErr6REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr24ASSERT_VIOLATIONMEMORY_FREE, lisErr5REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr23ASSERT_VIOLATIONMEMORY_FREE, lisErr17REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr25ASSERT_VIOLATIONMEMORY_FREE, lisErr18REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr22ASSERT_VIOLATIONMEMORY_FREE, lisErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-02 20:12:35,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:12:35,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1475968079, now seen corresponding path program 1 times [2018-12-02 20:12:35,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:12:35,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:12:35,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:12:35,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:12:35,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:12:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:12:35,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:12:35,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:12:35,386 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c166a9b-e749-4bb6-a3a2-261158dcee30/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 20:12:35,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:12:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:12:35,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:12:35,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:12:35,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 20:12:35,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-12-02 20:12:35,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 20:12:35,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 20:12:35,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 20:12:35,446 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 8 states. [2018-12-02 20:12:35,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:12:35,550 INFO L93 Difference]: Finished difference Result 134 states and 152 transitions. [2018-12-02 20:12:35,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 20:12:35,551 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-12-02 20:12:35,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:12:35,551 INFO L225 Difference]: With dead ends: 134 [2018-12-02 20:12:35,551 INFO L226 Difference]: Without dead ends: 134 [2018-12-02 20:12:35,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-02 20:12:35,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-02 20:12:35,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 77. [2018-12-02 20:12:35,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-02 20:12:35,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2018-12-02 20:12:35,555 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 92 transitions. Word has length 17 [2018-12-02 20:12:35,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:12:35,555 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 92 transitions. [2018-12-02 20:12:35,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 20:12:35,555 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2018-12-02 20:12:35,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 20:12:35,556 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:12:35,556 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:12:35,556 INFO L423 AbstractCegarLoop]: === Iteration 8 === [lisErr6REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr24ASSERT_VIOLATIONMEMORY_FREE, lisErr5REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr23ASSERT_VIOLATIONMEMORY_FREE, lisErr17REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr25ASSERT_VIOLATIONMEMORY_FREE, lisErr18REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr22ASSERT_VIOLATIONMEMORY_FREE, lisErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-02 20:12:35,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:12:35,556 INFO L82 PathProgramCache]: Analyzing trace with hash -29460584, now seen corresponding path program 1 times [2018-12-02 20:12:35,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:12:35,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:12:35,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:12:35,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:12:35,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:12:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:12:35,572 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 20:12:35,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:12:35,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 20:12:35,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 20:12:35,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 20:12:35,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 20:12:35,573 INFO L87 Difference]: Start difference. First operand 77 states and 92 transitions. Second operand 4 states. [2018-12-02 20:12:35,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:12:35,596 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2018-12-02 20:12:35,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:12:35,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-12-02 20:12:35,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:12:35,598 INFO L225 Difference]: With dead ends: 76 [2018-12-02 20:12:35,598 INFO L226 Difference]: Without dead ends: 76 [2018-12-02 20:12:35,598 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 20:12:35,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-02 20:12:35,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-02 20:12:35,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-02 20:12:35,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2018-12-02 20:12:35,602 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 17 [2018-12-02 20:12:35,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:12:35,602 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2018-12-02 20:12:35,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 20:12:35,602 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2018-12-02 20:12:35,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 20:12:35,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:12:35,603 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 20:12:35,603 INFO L423 AbstractCegarLoop]: === Iteration 9 === [lisErr6REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr24ASSERT_VIOLATIONMEMORY_FREE, lisErr5REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr23ASSERT_VIOLATIONMEMORY_FREE, lisErr17REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr25ASSERT_VIOLATIONMEMORY_FREE, lisErr18REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr22ASSERT_VIOLATIONMEMORY_FREE, lisErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-02 20:12:35,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:12:35,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1489644493, now seen corresponding path program 1 times [2018-12-02 20:12:35,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:12:35,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:12:35,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:12:35,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:12:35,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:12:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:12:35,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:12:35,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:12:35,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 20:12:35,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 20:12:35,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 20:12:35,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-02 20:12:35,672 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand 8 states. [2018-12-02 20:12:35,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:12:35,760 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2018-12-02 20:12:35,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 20:12:35,760 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-12-02 20:12:35,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:12:35,761 INFO L225 Difference]: With dead ends: 83 [2018-12-02 20:12:35,761 INFO L226 Difference]: Without dead ends: 83 [2018-12-02 20:12:35,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-02 20:12:35,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-02 20:12:35,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 70. [2018-12-02 20:12:35,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-02 20:12:35,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2018-12-02 20:12:35,765 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 18 [2018-12-02 20:12:35,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:12:35,765 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2018-12-02 20:12:35,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 20:12:35,765 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2018-12-02 20:12:35,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 20:12:35,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:12:35,766 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:12:35,766 INFO L423 AbstractCegarLoop]: === Iteration 10 === [lisErr6REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr24ASSERT_VIOLATIONMEMORY_FREE, lisErr5REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr23ASSERT_VIOLATIONMEMORY_FREE, lisErr17REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr25ASSERT_VIOLATIONMEMORY_FREE, lisErr18REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr22ASSERT_VIOLATIONMEMORY_FREE, lisErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-02 20:12:35,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:12:35,766 INFO L82 PathProgramCache]: Analyzing trace with hash -892812182, now seen corresponding path program 2 times [2018-12-02 20:12:35,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:12:35,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:12:35,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:12:35,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:12:35,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:12:35,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:12:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:12:35,806 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 20:12:35,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 08:12:35 BoogieIcfgContainer [2018-12-02 20:12:35,824 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 20:12:35,824 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 20:12:35,824 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 20:12:35,825 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 20:12:35,825 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:12:34" (3/4) ... [2018-12-02 20:12:35,827 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 20:12:35,853 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4c166a9b-e749-4bb6-a3a2-261158dcee30/bin-2019/uautomizer/witness.graphml [2018-12-02 20:12:35,853 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 20:12:35,854 INFO L168 Benchmark]: Toolchain (without parser) took 2075.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 951.7 MB in the beginning and 1.0 GB in the end (delta: -89.8 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. [2018-12-02 20:12:35,855 INFO L168 Benchmark]: CDTParser took 0.10 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 20:12:35,855 INFO L168 Benchmark]: CACSL2BoogieTranslator took 269.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -164.5 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-12-02 20:12:35,855 INFO L168 Benchmark]: Boogie Preprocessor took 31.39 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 20:12:35,855 INFO L168 Benchmark]: RCFGBuilder took 276.30 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: 52.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. [2018-12-02 20:12:35,856 INFO L168 Benchmark]: TraceAbstraction took 1466.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2018-12-02 20:12:35,856 INFO L168 Benchmark]: Witness Printer took 28.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-02 20:12:35,858 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.10 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 269.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -164.5 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.39 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 276.30 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: 52.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1466.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * Witness Printer took 28.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 549]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L559] int *a; [L560] int N = __VERIFIER_nondet_int(); [L561] CALL lis(a, N) VAL [\old(N)=2, a={10:-5}] [L542] int *best, *prev, i, j, max = 0; [L543] best = (int*) malloc(sizeof(int) * N) [L544] prev = (int*) malloc(sizeof(int) * N) [L545] i = 0 VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={13:0}, i=0, malloc(sizeof(int) * N)={11:0}, malloc(sizeof(int) * N)={13:0}, max=0, N=2, prev={11:0}] [L545] COND TRUE i < N VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={13:0}, i=0, malloc(sizeof(int) * N)={11:0}, malloc(sizeof(int) * N)={13:0}, max=0, N=2, prev={11:0}] [L546] best[i] = 1 VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={13:0}, i=0, malloc(sizeof(int) * N)={11:0}, malloc(sizeof(int) * N)={13:0}, max=0, N=2, prev={11:0}] [L546] prev[i] = i VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={13:0}, i=0, malloc(sizeof(int) * N)={11:0}, malloc(sizeof(int) * N)={13:0}, max=0, N=2, prev={11:0}] [L545] i++ VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={13:0}, i=1, malloc(sizeof(int) * N)={11:0}, malloc(sizeof(int) * N)={13:0}, max=0, N=2, prev={11:0}] [L545] COND TRUE i < N VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={13:0}, i=1, malloc(sizeof(int) * N)={11:0}, malloc(sizeof(int) * N)={13:0}, max=0, N=2, prev={11:0}] [L546] best[i] = 1 VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={13:0}, i=1, malloc(sizeof(int) * N)={11:0}, malloc(sizeof(int) * N)={13:0}, max=0, N=2, prev={11:0}] [L546] prev[i] = i VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={13:0}, i=1, malloc(sizeof(int) * N)={11:0}, malloc(sizeof(int) * N)={13:0}, max=0, N=2, prev={11:0}] [L545] i++ VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={13:0}, i=2, malloc(sizeof(int) * N)={11:0}, malloc(sizeof(int) * N)={13:0}, max=0, N=2, prev={11:0}] [L545] COND FALSE !(i < N) VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={13:0}, i=2, malloc(sizeof(int) * N)={11:0}, malloc(sizeof(int) * N)={13:0}, max=0, N=2, prev={11:0}] [L547] i = 1 VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={13:0}, i=1, malloc(sizeof(int) * N)={11:0}, malloc(sizeof(int) * N)={13:0}, max=0, N=2, prev={11:0}] [L547] COND TRUE i < N [L548] j = 0 VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={13:0}, i=1, j=0, malloc(sizeof(int) * N)={11:0}, malloc(sizeof(int) * N)={13:0}, max=0, N=2, prev={11:0}] [L548] COND TRUE j < i VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={13:0}, i=1, j=0, malloc(sizeof(int) * N)={11:0}, malloc(sizeof(int) * N)={13:0}, max=0, N=2, prev={11:0}] [L549] a[i] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 80 locations, 27 error locations. UNSAFE Result, 1.4s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 405 SDtfs, 810 SDslu, 515 SDs, 0 SdLazy, 697 SolverSat, 82 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=7, 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, 9 MinimizatonAttempts, 122 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 173 NumberOfCodeBlocks, 173 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 141 ConstructedInterpolants, 6 QuantifiedInterpolants, 9553 SizeOfPredicates, 8 NumberOfNonLiveVariables, 182 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 3/7 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...