./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety-realloc/array-realloc-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3b6a9a19-2567-445e-9a20-08b77ce18915/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3b6a9a19-2567-445e-9a20-08b77ce18915/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3b6a9a19-2567-445e-9a20-08b77ce18915/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3b6a9a19-2567-445e-9a20-08b77ce18915/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety-realloc/array-realloc-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3b6a9a19-2567-445e-9a20-08b77ce18915/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3b6a9a19-2567-445e-9a20-08b77ce18915/bin/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 5ce6ab98ff3a344cbd8c93195b0f965c65d244bc ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:59:40,651 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:59:40,654 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:59:40,665 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:59:40,665 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:59:40,667 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:59:40,668 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:59:40,669 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:59:40,671 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:59:40,674 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:59:40,676 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:59:40,677 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:59:40,682 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:59:40,684 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:59:40,685 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:59:40,685 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:59:40,686 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:59:40,686 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:59:40,687 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:59:40,688 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:59:40,689 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:59:40,690 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:59:40,691 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:59:40,691 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:59:40,693 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:59:40,693 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:59:40,693 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:59:40,694 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:59:40,694 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:59:40,695 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:59:40,695 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:59:40,696 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:59:40,696 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:59:40,697 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:59:40,698 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:59:40,698 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:59:40,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:59:40,699 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:59:40,699 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:59:40,699 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:59:40,700 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:59:40,700 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3b6a9a19-2567-445e-9a20-08b77ce18915/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-10-22 08:59:40,710 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:59:40,710 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:59:40,711 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:59:40,711 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:59:40,711 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:59:40,711 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:59:40,712 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:59:40,712 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:59:40,712 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:59:40,712 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:59:40,712 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:59:40,712 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-10-22 08:59:40,712 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-10-22 08:59:40,713 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-10-22 08:59:40,713 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:59:40,713 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:59:40,713 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:59:40,713 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:59:40,713 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:59:40,714 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:59:40,714 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:59:40,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:59:40,714 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:59:40,718 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:59:40,719 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:59:40,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:59:40,719 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_3b6a9a19-2567-445e-9a20-08b77ce18915/bin/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 -> 5ce6ab98ff3a344cbd8c93195b0f965c65d244bc [2019-10-22 08:59:40,747 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:59:40,758 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:59:40,760 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:59:40,761 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:59:40,762 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:59:40,762 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3b6a9a19-2567-445e-9a20-08b77ce18915/bin/uautomizer/../../sv-benchmarks/c/array-memsafety-realloc/array-realloc-2.i [2019-10-22 08:59:40,813 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3b6a9a19-2567-445e-9a20-08b77ce18915/bin/uautomizer/data/516ed23d1/ef8419a26b064186bcd14eb21b542ce7/FLAG5e16072b4 [2019-10-22 08:59:41,249 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:59:41,250 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3b6a9a19-2567-445e-9a20-08b77ce18915/sv-benchmarks/c/array-memsafety-realloc/array-realloc-2.i [2019-10-22 08:59:41,260 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3b6a9a19-2567-445e-9a20-08b77ce18915/bin/uautomizer/data/516ed23d1/ef8419a26b064186bcd14eb21b542ce7/FLAG5e16072b4 [2019-10-22 08:59:41,270 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3b6a9a19-2567-445e-9a20-08b77ce18915/bin/uautomizer/data/516ed23d1/ef8419a26b064186bcd14eb21b542ce7 [2019-10-22 08:59:41,273 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:59:41,274 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-10-22 08:59:41,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:41,275 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:59:41,278 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:59:41,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:41" (1/1) ... [2019-10-22 08:59:41,281 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f124557 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:41, skipping insertion in model container [2019-10-22 08:59:41,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:41" (1/1) ... [2019-10-22 08:59:41,288 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:59:41,319 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:59:41,638 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:41,658 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:59:41,688 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:41,743 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:59:41,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:41 WrapperNode [2019-10-22 08:59:41,744 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:41,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:59:41,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:59:41,745 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:59:41,756 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:41" (1/1) ... [2019-10-22 08:59:41,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:41" (1/1) ... [2019-10-22 08:59:41,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:41" (1/1) ... [2019-10-22 08:59:41,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:41" (1/1) ... [2019-10-22 08:59:41,800 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:41" (1/1) ... [2019-10-22 08:59:41,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:41" (1/1) ... [2019-10-22 08:59:41,809 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:41" (1/1) ... [2019-10-22 08:59:41,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:59:41,814 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:59:41,814 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:59:41,814 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:59:41,815 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b6a9a19-2567-445e-9a20-08b77ce18915/bin/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 [2019-10-22 08:59:41,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-22 08:59:41,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:59:41,888 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-22 08:59:41,888 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-22 08:59:41,888 INFO L138 BoogieDeclarations]: Found implementation of procedure expandArray [2019-10-22 08:59:41,888 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-22 08:59:41,889 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc [2019-10-22 08:59:41,890 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-22 08:59:41,890 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-22 08:59:41,890 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-22 08:59:41,890 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-22 08:59:41,890 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-22 08:59:41,890 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-22 08:59:41,890 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-22 08:59:41,890 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-22 08:59:41,891 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-22 08:59:41,891 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-22 08:59:41,891 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-22 08:59:41,891 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-22 08:59:41,891 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-22 08:59:41,891 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-22 08:59:41,891 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-22 08:59:41,891 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-22 08:59:41,892 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-22 08:59:41,892 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-22 08:59:41,892 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-22 08:59:41,892 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-22 08:59:41,892 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-22 08:59:41,892 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-22 08:59:41,892 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-22 08:59:41,892 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-22 08:59:41,893 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-22 08:59:41,893 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-22 08:59:41,893 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-22 08:59:41,893 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-22 08:59:41,893 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-22 08:59:41,893 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-22 08:59:41,893 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-22 08:59:41,893 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-22 08:59:41,893 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-22 08:59:41,894 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-22 08:59:41,894 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-22 08:59:41,894 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-22 08:59:41,894 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-22 08:59:41,894 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-22 08:59:41,894 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-22 08:59:41,896 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-22 08:59:41,897 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-22 08:59:41,897 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-22 08:59:41,897 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-22 08:59:41,897 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-22 08:59:41,897 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-22 08:59:41,897 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-22 08:59:41,897 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-22 08:59:41,897 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-22 08:59:41,897 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-22 08:59:41,898 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-22 08:59:41,898 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-22 08:59:41,898 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-22 08:59:41,898 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-22 08:59:41,898 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-22 08:59:41,898 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-22 08:59:41,899 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-22 08:59:41,899 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-22 08:59:41,899 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-22 08:59:41,899 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-22 08:59:41,899 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-22 08:59:41,899 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-22 08:59:41,899 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-22 08:59:41,899 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-22 08:59:41,899 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-22 08:59:41,899 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-22 08:59:41,900 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-22 08:59:41,900 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-22 08:59:41,900 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-22 08:59:41,900 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-22 08:59:41,900 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-22 08:59:41,900 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-22 08:59:41,900 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-22 08:59:41,900 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-22 08:59:41,900 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-22 08:59:41,900 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-22 08:59:41,901 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-22 08:59:41,901 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-22 08:59:41,901 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-22 08:59:41,901 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-22 08:59:41,901 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-22 08:59:41,901 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-22 08:59:41,901 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-22 08:59:41,901 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-22 08:59:41,901 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-22 08:59:41,901 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-22 08:59:41,902 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-22 08:59:41,902 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-22 08:59:41,902 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-22 08:59:41,902 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-22 08:59:41,902 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-22 08:59:41,902 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-22 08:59:41,902 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-22 08:59:41,905 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-22 08:59:41,906 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-22 08:59:41,906 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-22 08:59:41,906 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-22 08:59:41,906 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-22 08:59:41,906 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-22 08:59:41,906 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-22 08:59:41,906 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-22 08:59:41,906 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-22 08:59:41,906 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-22 08:59:41,906 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-22 08:59:41,907 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-22 08:59:41,907 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-22 08:59:41,907 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-22 08:59:41,907 INFO L130 BoogieDeclarations]: Found specification of procedure expandArray [2019-10-22 08:59:41,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc [2019-10-22 08:59:41,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 08:59:41,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:59:41,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 08:59:41,908 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-22 08:59:41,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 08:59:41,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:59:41,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-22 08:59:41,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:59:41,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-22 08:59:41,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:59:41,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:59:42,486 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:59:42,486 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-22 08:59:42,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:42 BoogieIcfgContainer [2019-10-22 08:59:42,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:59:42,489 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:59:42,490 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:59:42,493 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:59:42,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:59:41" (1/3) ... [2019-10-22 08:59:42,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@349afad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:59:42, skipping insertion in model container [2019-10-22 08:59:42,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:41" (2/3) ... [2019-10-22 08:59:42,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@349afad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:59:42, skipping insertion in model container [2019-10-22 08:59:42,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:42" (3/3) ... [2019-10-22 08:59:42,498 INFO L109 eAbstractionObserver]: Analyzing ICFG array-realloc-2.i [2019-10-22 08:59:42,507 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:59:42,514 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2019-10-22 08:59:42,526 INFO L249 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2019-10-22 08:59:42,544 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:59:42,544 INFO L374 AbstractCegarLoop]: Hoare is false [2019-10-22 08:59:42,544 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:59:42,544 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:59:42,546 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:59:42,546 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:59:42,547 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:59:42,547 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:59:42,562 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-10-22 08:59:42,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 08:59:42,571 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:42,571 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:42,573 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION]=== [2019-10-22 08:59:42,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:42,578 INFO L82 PathProgramCache]: Analyzing trace with hash 529620371, now seen corresponding path program 1 times [2019-10-22 08:59:42,586 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:42,586 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236069456] [2019-10-22 08:59:42,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:42,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:42,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:42,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:42,767 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236069456] [2019-10-22 08:59:42,768 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:42,769 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:42,769 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405139403] [2019-10-22 08:59:42,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:59:42,773 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:42,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:59:42,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:59:42,787 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 4 states. [2019-10-22 08:59:42,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:42,885 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2019-10-22 08:59:42,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:59:42,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-10-22 08:59:42,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:42,898 INFO L225 Difference]: With dead ends: 56 [2019-10-22 08:59:42,898 INFO L226 Difference]: Without dead ends: 52 [2019-10-22 08:59:42,903 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:59:42,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-22 08:59:42,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2019-10-22 08:59:42,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-22 08:59:42,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-10-22 08:59:42,949 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 8 [2019-10-22 08:59:42,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:42,949 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-10-22 08:59:42,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:59:42,949 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-10-22 08:59:42,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 08:59:42,950 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:42,950 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:42,950 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION]=== [2019-10-22 08:59:42,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:42,952 INFO L82 PathProgramCache]: Analyzing trace with hash 529620385, now seen corresponding path program 1 times [2019-10-22 08:59:42,952 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:42,952 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184014381] [2019-10-22 08:59:42,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:42,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:42,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:43,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:43,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184014381] [2019-10-22 08:59:43,054 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:43,054 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:43,054 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663329734] [2019-10-22 08:59:43,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:59:43,056 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:43,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:59:43,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:59:43,056 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 4 states. [2019-10-22 08:59:43,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:43,180 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2019-10-22 08:59:43,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:59:43,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-10-22 08:59:43,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:43,181 INFO L225 Difference]: With dead ends: 47 [2019-10-22 08:59:43,181 INFO L226 Difference]: Without dead ends: 47 [2019-10-22 08:59:43,182 INFO L600 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 [2019-10-22 08:59:43,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-22 08:59:43,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2019-10-22 08:59:43,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-22 08:59:43,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-10-22 08:59:43,187 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 8 [2019-10-22 08:59:43,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:43,187 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-10-22 08:59:43,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:59:43,187 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-10-22 08:59:43,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 08:59:43,187 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:43,188 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:43,188 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION]=== [2019-10-22 08:59:43,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:43,188 INFO L82 PathProgramCache]: Analyzing trace with hash 529620384, now seen corresponding path program 1 times [2019-10-22 08:59:43,188 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:43,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673789988] [2019-10-22 08:59:43,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:43,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:43,254 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673789988] [2019-10-22 08:59:43,255 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:43,255 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:43,255 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470384415] [2019-10-22 08:59:43,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:59:43,255 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:43,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:59:43,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:59:43,256 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 4 states. [2019-10-22 08:59:43,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:43,388 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-10-22 08:59:43,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:59:43,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-10-22 08:59:43,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:43,389 INFO L225 Difference]: With dead ends: 49 [2019-10-22 08:59:43,389 INFO L226 Difference]: Without dead ends: 49 [2019-10-22 08:59:43,390 INFO L600 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 [2019-10-22 08:59:43,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-22 08:59:43,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-10-22 08:59:43,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-22 08:59:43,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2019-10-22 08:59:43,396 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 8 [2019-10-22 08:59:43,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:43,397 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2019-10-22 08:59:43,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:59:43,397 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2019-10-22 08:59:43,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 08:59:43,397 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:43,397 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:43,398 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION]=== [2019-10-22 08:59:43,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:43,398 INFO L82 PathProgramCache]: Analyzing trace with hash -2135919539, now seen corresponding path program 1 times [2019-10-22 08:59:43,398 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:43,398 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516912743] [2019-10-22 08:59:43,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:43,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:43,477 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516912743] [2019-10-22 08:59:43,478 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:43,478 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:59:43,478 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33095976] [2019-10-22 08:59:43,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:59:43,478 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:43,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:59:43,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:59:43,479 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 5 states. [2019-10-22 08:59:43,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:43,578 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2019-10-22 08:59:43,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:59:43,578 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-10-22 08:59:43,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:43,579 INFO L225 Difference]: With dead ends: 48 [2019-10-22 08:59:43,579 INFO L226 Difference]: Without dead ends: 48 [2019-10-22 08:59:43,580 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:59:43,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-22 08:59:43,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-10-22 08:59:43,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-22 08:59:43,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-10-22 08:59:43,584 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 10 [2019-10-22 08:59:43,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:43,584 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-10-22 08:59:43,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:59:43,585 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-10-22 08:59:43,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 08:59:43,585 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:43,585 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:43,586 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION]=== [2019-10-22 08:59:43,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:43,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1236436269, now seen corresponding path program 1 times [2019-10-22 08:59:43,586 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:43,586 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649466072] [2019-10-22 08:59:43,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:43,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:43,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:43,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:43,693 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649466072] [2019-10-22 08:59:43,694 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:43,694 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:59:43,694 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897881876] [2019-10-22 08:59:43,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:59:43,695 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:43,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:59:43,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:59:43,695 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 6 states. [2019-10-22 08:59:43,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:43,903 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2019-10-22 08:59:43,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:59:43,904 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-10-22 08:59:43,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:43,905 INFO L225 Difference]: With dead ends: 53 [2019-10-22 08:59:43,905 INFO L226 Difference]: Without dead ends: 53 [2019-10-22 08:59:43,906 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:59:43,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-22 08:59:43,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2019-10-22 08:59:43,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-22 08:59:43,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-10-22 08:59:43,915 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 13 [2019-10-22 08:59:43,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:43,915 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-10-22 08:59:43,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:59:43,916 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-10-22 08:59:43,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 08:59:43,916 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:43,916 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:43,917 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION]=== [2019-10-22 08:59:43,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:43,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1236436268, now seen corresponding path program 1 times [2019-10-22 08:59:43,917 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:43,917 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688565957] [2019-10-22 08:59:43,917 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:44,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:44,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:44,026 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688565957] [2019-10-22 08:59:44,027 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:44,027 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:59:44,027 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215421191] [2019-10-22 08:59:44,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:59:44,028 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:44,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:59:44,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:59:44,028 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 7 states. [2019-10-22 08:59:44,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:44,206 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-10-22 08:59:44,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:59:44,207 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-10-22 08:59:44,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:44,207 INFO L225 Difference]: With dead ends: 49 [2019-10-22 08:59:44,208 INFO L226 Difference]: Without dead ends: 49 [2019-10-22 08:59:44,208 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:59:44,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-22 08:59:44,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-10-22 08:59:44,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-22 08:59:44,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2019-10-22 08:59:44,212 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 13 [2019-10-22 08:59:44,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:44,213 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2019-10-22 08:59:44,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:59:44,213 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2019-10-22 08:59:44,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 08:59:44,214 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:44,214 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:44,214 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION]=== [2019-10-22 08:59:44,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:44,215 INFO L82 PathProgramCache]: Analyzing trace with hash -2119265845, now seen corresponding path program 1 times [2019-10-22 08:59:44,215 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:44,215 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099223774] [2019-10-22 08:59:44,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:44,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:44,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:44,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:44,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:44,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099223774] [2019-10-22 08:59:44,354 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:44,355 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 08:59:44,355 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67699318] [2019-10-22 08:59:44,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 08:59:44,355 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:44,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 08:59:44,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:59:44,356 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 8 states. [2019-10-22 08:59:44,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:44,580 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2019-10-22 08:59:44,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:59:44,581 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-10-22 08:59:44,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:44,582 INFO L225 Difference]: With dead ends: 43 [2019-10-22 08:59:44,582 INFO L226 Difference]: Without dead ends: 43 [2019-10-22 08:59:44,582 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-10-22 08:59:44,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-22 08:59:44,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-10-22 08:59:44,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-22 08:59:44,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2019-10-22 08:59:44,585 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 18 [2019-10-22 08:59:44,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:44,586 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2019-10-22 08:59:44,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 08:59:44,586 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2019-10-22 08:59:44,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 08:59:44,587 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:44,587 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:44,587 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION]=== [2019-10-22 08:59:44,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:44,588 INFO L82 PathProgramCache]: Analyzing trace with hash 2000066657, now seen corresponding path program 1 times [2019-10-22 08:59:44,588 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:44,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175065424] [2019-10-22 08:59:44,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:44,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:44,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:44,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:44,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:44,668 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175065424] [2019-10-22 08:59:44,668 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:44,669 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:59:44,669 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174226724] [2019-10-22 08:59:44,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:59:44,669 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:44,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:59:44,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:59:44,670 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 7 states. [2019-10-22 08:59:44,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:44,865 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-10-22 08:59:44,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:59:44,866 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-10-22 08:59:44,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:44,867 INFO L225 Difference]: With dead ends: 43 [2019-10-22 08:59:44,867 INFO L226 Difference]: Without dead ends: 43 [2019-10-22 08:59:44,867 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:59:44,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-22 08:59:44,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-10-22 08:59:44,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-22 08:59:44,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-10-22 08:59:44,872 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 20 [2019-10-22 08:59:44,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:44,873 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-10-22 08:59:44,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:59:44,873 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-10-22 08:59:44,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 08:59:44,873 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:44,873 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:44,873 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION]=== [2019-10-22 08:59:44,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:44,874 INFO L82 PathProgramCache]: Analyzing trace with hash 2000066658, now seen corresponding path program 1 times [2019-10-22 08:59:44,874 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:44,874 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40343438] [2019-10-22 08:59:44,874 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:44,874 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:44,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:44,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:44,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40343438] [2019-10-22 08:59:44,986 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:44,986 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-22 08:59:44,986 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222384742] [2019-10-22 08:59:44,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-22 08:59:44,987 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:44,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-22 08:59:44,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-22 08:59:44,987 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 11 states. [2019-10-22 08:59:45,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:45,268 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-10-22 08:59:45,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 08:59:45,268 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-10-22 08:59:45,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:45,269 INFO L225 Difference]: With dead ends: 46 [2019-10-22 08:59:45,269 INFO L226 Difference]: Without dead ends: 46 [2019-10-22 08:59:45,269 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-10-22 08:59:45,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-22 08:59:45,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-10-22 08:59:45,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-22 08:59:45,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-10-22 08:59:45,273 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 20 [2019-10-22 08:59:45,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:45,274 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-10-22 08:59:45,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-22 08:59:45,274 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-10-22 08:59:45,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 08:59:45,275 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:45,275 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:45,276 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION]=== [2019-10-22 08:59:45,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:45,276 INFO L82 PathProgramCache]: Analyzing trace with hash 2028695809, now seen corresponding path program 1 times [2019-10-22 08:59:45,276 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:45,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082465809] [2019-10-22 08:59:45,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:45,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:45,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:45,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:45,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082465809] [2019-10-22 08:59:45,392 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:45,392 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 08:59:45,392 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368495934] [2019-10-22 08:59:45,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 08:59:45,393 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:45,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 08:59:45,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:59:45,393 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 9 states. [2019-10-22 08:59:45,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:45,641 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-10-22 08:59:45,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 08:59:45,641 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-10-22 08:59:45,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:45,642 INFO L225 Difference]: With dead ends: 44 [2019-10-22 08:59:45,642 INFO L226 Difference]: Without dead ends: 44 [2019-10-22 08:59:45,643 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-10-22 08:59:45,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-22 08:59:45,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-10-22 08:59:45,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-22 08:59:45,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-10-22 08:59:45,647 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 20 [2019-10-22 08:59:45,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:45,647 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-10-22 08:59:45,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 08:59:45,647 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-10-22 08:59:45,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 08:59:45,648 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:45,648 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:45,648 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION]=== [2019-10-22 08:59:45,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:45,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1534939367, now seen corresponding path program 1 times [2019-10-22 08:59:45,649 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:45,649 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286238133] [2019-10-22 08:59:45,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:45,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:45,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:45,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:45,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:45,788 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286238133] [2019-10-22 08:59:45,788 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:45,788 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 08:59:45,788 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867126157] [2019-10-22 08:59:45,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 08:59:45,788 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:45,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 08:59:45,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:59:45,789 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 10 states. [2019-10-22 08:59:46,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:46,094 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-10-22 08:59:46,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 08:59:46,095 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-10-22 08:59:46,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:46,095 INFO L225 Difference]: With dead ends: 51 [2019-10-22 08:59:46,095 INFO L226 Difference]: Without dead ends: 51 [2019-10-22 08:59:46,096 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-10-22 08:59:46,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-22 08:59:46,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-10-22 08:59:46,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-22 08:59:46,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2019-10-22 08:59:46,101 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 21 [2019-10-22 08:59:46,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:46,102 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2019-10-22 08:59:46,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 08:59:46,102 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2019-10-22 08:59:46,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 08:59:46,102 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:46,102 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:46,102 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION]=== [2019-10-22 08:59:46,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:46,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1534939366, now seen corresponding path program 1 times [2019-10-22 08:59:46,103 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:46,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883446806] [2019-10-22 08:59:46,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:46,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:46,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:46,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:46,228 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883446806] [2019-10-22 08:59:46,228 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:46,229 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 08:59:46,229 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554579453] [2019-10-22 08:59:46,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 08:59:46,229 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:46,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 08:59:46,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:59:46,230 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 9 states. [2019-10-22 08:59:46,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:46,493 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-10-22 08:59:46,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 08:59:46,494 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-10-22 08:59:46,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:46,495 INFO L225 Difference]: With dead ends: 45 [2019-10-22 08:59:46,495 INFO L226 Difference]: Without dead ends: 45 [2019-10-22 08:59:46,495 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-10-22 08:59:46,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-22 08:59:46,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-10-22 08:59:46,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-22 08:59:46,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-10-22 08:59:46,498 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 21 [2019-10-22 08:59:46,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:46,503 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-10-22 08:59:46,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 08:59:46,503 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-10-22 08:59:46,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 08:59:46,503 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:46,503 INFO L380 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, 1] [2019-10-22 08:59:46,504 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION]=== [2019-10-22 08:59:46,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:46,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1895188378, now seen corresponding path program 1 times [2019-10-22 08:59:46,504 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:46,504 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995169026] [2019-10-22 08:59:46,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:46,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:46,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:46,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:46,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:46,646 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995169026] [2019-10-22 08:59:46,646 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:46,646 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 08:59:46,646 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167870241] [2019-10-22 08:59:46,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 08:59:46,646 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:46,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 08:59:46,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:59:46,647 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 8 states. [2019-10-22 08:59:46,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:46,774 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2019-10-22 08:59:46,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:59:46,774 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-10-22 08:59:46,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:46,775 INFO L225 Difference]: With dead ends: 45 [2019-10-22 08:59:46,775 INFO L226 Difference]: Without dead ends: 45 [2019-10-22 08:59:46,775 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:59:46,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-22 08:59:46,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-10-22 08:59:46,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-22 08:59:46,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-10-22 08:59:46,778 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 23 [2019-10-22 08:59:46,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:46,782 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-10-22 08:59:46,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 08:59:46,783 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-10-22 08:59:46,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 08:59:46,783 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:46,783 INFO L380 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, 1, 1, 1, 1, 1] [2019-10-22 08:59:46,784 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION]=== [2019-10-22 08:59:46,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:46,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1554357335, now seen corresponding path program 1 times [2019-10-22 08:59:46,784 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:46,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916838493] [2019-10-22 08:59:46,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:46,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:46,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:46,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:46,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:46,896 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916838493] [2019-10-22 08:59:46,896 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948357150] [2019-10-22 08:59:46,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b6a9a19-2567-445e-9a20-08b77ce18915/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:47,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-22 08:59:47,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:47,123 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2019-10-22 08:59:47,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:47,129 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:47,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:47,130 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:3 [2019-10-22 08:59:47,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:59:47,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:59:47,281 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 08:59:47,308 INFO L341 Elim1Store]: treesize reduction 4, result has 87.9 percent of original size [2019-10-22 08:59:47,308 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 37 [2019-10-22 08:59:47,309 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:47,331 INFO L567 ElimStorePlain]: treesize reduction 14, result has 64.1 percent of original size [2019-10-22 08:59:47,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:47,335 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-22 08:59:47,336 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:25 [2019-10-22 08:59:47,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:47,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:47,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:47,395 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:59:47,395 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 15 [2019-10-22 08:59:47,395 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459733012] [2019-10-22 08:59:47,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-22 08:59:47,396 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:47,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-22 08:59:47,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-10-22 08:59:47,396 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 16 states. [2019-10-22 08:59:47,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:47,950 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2019-10-22 08:59:47,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-22 08:59:47,950 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-10-22 08:59:47,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:47,951 INFO L225 Difference]: With dead ends: 59 [2019-10-22 08:59:47,951 INFO L226 Difference]: Without dead ends: 59 [2019-10-22 08:59:47,952 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2019-10-22 08:59:47,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-22 08:59:47,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2019-10-22 08:59:47,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-22 08:59:47,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-10-22 08:59:47,955 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 27 [2019-10-22 08:59:47,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:47,955 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-10-22 08:59:47,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-22 08:59:47,955 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-10-22 08:59:47,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-22 08:59:47,956 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:47,956 INFO L380 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, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:48,157 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:48,157 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION]=== [2019-10-22 08:59:48,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:48,158 INFO L82 PathProgramCache]: Analyzing trace with hash 940437124, now seen corresponding path program 1 times [2019-10-22 08:59:48,158 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:48,158 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424360267] [2019-10-22 08:59:48,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:48,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:48,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:48,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:48,338 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424360267] [2019-10-22 08:59:48,339 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946260789] [2019-10-22 08:59:48,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b6a9a19-2567-445e-9a20-08b77ce18915/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:48,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-22 08:59:48,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:48,463 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2019-10-22 08:59:48,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:48,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:48,466 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:48,467 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-10-22 08:59:48,487 INFO L375 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 15 treesize of output 7 [2019-10-22 08:59:48,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:48,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:48,489 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:48,489 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-22 08:59:48,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:48,491 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:59:48,491 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 13 [2019-10-22 08:59:48,491 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296843223] [2019-10-22 08:59:48,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-22 08:59:48,491 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:48,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-22 08:59:48,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-10-22 08:59:48,492 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 14 states. [2019-10-22 08:59:48,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:48,796 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2019-10-22 08:59:48,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 08:59:48,797 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2019-10-22 08:59:48,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:48,797 INFO L225 Difference]: With dead ends: 43 [2019-10-22 08:59:48,797 INFO L226 Difference]: Without dead ends: 43 [2019-10-22 08:59:48,798 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2019-10-22 08:59:48,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-22 08:59:48,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-10-22 08:59:48,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-22 08:59:48,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2019-10-22 08:59:48,800 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 28 [2019-10-22 08:59:48,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:48,801 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2019-10-22 08:59:48,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-22 08:59:48,801 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2019-10-22 08:59:48,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-22 08:59:48,801 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:48,801 INFO L380 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:49,006 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:49,006 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION]=== [2019-10-22 08:59:49,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:49,007 INFO L82 PathProgramCache]: Analyzing trace with hash -911220169, now seen corresponding path program 1 times [2019-10-22 08:59:49,007 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:49,007 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424312875] [2019-10-22 08:59:49,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:49,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:49,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:49,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:49,160 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424312875] [2019-10-22 08:59:49,161 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370934384] [2019-10-22 08:59:49,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b6a9a19-2567-445e-9a20-08b77ce18915/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:49,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:49,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-22 08:59:49,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:49,284 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2019-10-22 08:59:49,284 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:49,289 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:49,289 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:49,289 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2019-10-22 08:59:49,310 INFO L375 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 17 treesize of output 9 [2019-10-22 08:59:49,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:49,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:49,314 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:49,314 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-10-22 08:59:49,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:49,316 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:59:49,317 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 13 [2019-10-22 08:59:49,317 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9845429] [2019-10-22 08:59:49,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-22 08:59:49,317 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:49,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-22 08:59:49,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-10-22 08:59:49,318 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 14 states. [2019-10-22 08:59:49,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:49,658 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-10-22 08:59:49,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 08:59:49,658 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2019-10-22 08:59:49,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:49,659 INFO L225 Difference]: With dead ends: 42 [2019-10-22 08:59:49,659 INFO L226 Difference]: Without dead ends: 42 [2019-10-22 08:59:49,659 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2019-10-22 08:59:49,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-22 08:59:49,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-10-22 08:59:49,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-22 08:59:49,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-10-22 08:59:49,661 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 29 [2019-10-22 08:59:49,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:49,662 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-10-22 08:59:49,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-22 08:59:49,662 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-10-22 08:59:49,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 08:59:49,666 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:49,666 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:49,867 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:49,867 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION]=== [2019-10-22 08:59:49,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:49,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1816945894, now seen corresponding path program 1 times [2019-10-22 08:59:49,868 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:49,868 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134506785] [2019-10-22 08:59:49,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:49,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:49,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:50,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:50,023 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134506785] [2019-10-22 08:59:50,023 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283605740] [2019-10-22 08:59:50,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b6a9a19-2567-445e-9a20-08b77ce18915/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:50,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-22 08:59:50,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:50,154 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2019-10-22 08:59:50,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:50,159 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:50,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:50,160 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2019-10-22 08:59:50,183 INFO L375 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 17 treesize of output 9 [2019-10-22 08:59:50,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:50,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:50,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:50,187 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-10-22 08:59:50,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:50,189 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:59:50,189 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 13 [2019-10-22 08:59:50,189 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408529808] [2019-10-22 08:59:50,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-22 08:59:50,190 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:50,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-22 08:59:50,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-10-22 08:59:50,191 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 14 states. [2019-10-22 08:59:50,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:50,458 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2019-10-22 08:59:50,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 08:59:50,458 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2019-10-22 08:59:50,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:50,459 INFO L225 Difference]: With dead ends: 41 [2019-10-22 08:59:50,459 INFO L226 Difference]: Without dead ends: 41 [2019-10-22 08:59:50,459 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2019-10-22 08:59:50,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-22 08:59:50,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-10-22 08:59:50,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-22 08:59:50,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-10-22 08:59:50,462 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 30 [2019-10-22 08:59:50,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:50,462 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-10-22 08:59:50,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-22 08:59:50,462 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-10-22 08:59:50,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 08:59:50,463 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:50,463 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:50,663 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:50,664 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION]=== [2019-10-22 08:59:50,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:50,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1392750719, now seen corresponding path program 1 times [2019-10-22 08:59:50,664 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:50,664 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743515993] [2019-10-22 08:59:50,665 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:50,665 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:50,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:50,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:50,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:50,764 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:59:50,765 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743515993] [2019-10-22 08:59:50,765 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587389474] [2019-10-22 08:59:50,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b6a9a19-2567-445e-9a20-08b77ce18915/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:50,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-22 08:59:50,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:50,864 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 11 treesize of output 7 [2019-10-22 08:59:50,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:50,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:50,872 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:50,872 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2019-10-22 08:59:50,876 INFO L375 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 16 treesize of output 8 [2019-10-22 08:59:50,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:50,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:50,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:50,878 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2019-10-22 08:59:50,880 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:59:50,880 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:59:50,880 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 11 [2019-10-22 08:59:50,880 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682445625] [2019-10-22 08:59:50,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-22 08:59:50,881 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:50,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-22 08:59:50,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-22 08:59:50,881 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 11 states. [2019-10-22 08:59:51,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:51,061 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2019-10-22 08:59:51,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 08:59:51,063 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2019-10-22 08:59:51,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:51,063 INFO L225 Difference]: With dead ends: 41 [2019-10-22 08:59:51,063 INFO L226 Difference]: Without dead ends: 39 [2019-10-22 08:59:51,064 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-10-22 08:59:51,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-22 08:59:51,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-10-22 08:59:51,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-22 08:59:51,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-10-22 08:59:51,066 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 31 [2019-10-22 08:59:51,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:51,066 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-10-22 08:59:51,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-22 08:59:51,066 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-10-22 08:59:51,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 08:59:51,073 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:51,073 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:51,274 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:51,274 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION]=== [2019-10-22 08:59:51,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:51,274 INFO L82 PathProgramCache]: Analyzing trace with hash -2014712896, now seen corresponding path program 1 times [2019-10-22 08:59:51,275 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:51,275 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460132392] [2019-10-22 08:59:51,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:51,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:51,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:51,441 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:59:51,441 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460132392] [2019-10-22 08:59:51,442 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387725540] [2019-10-22 08:59:51,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b6a9a19-2567-445e-9a20-08b77ce18915/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:51,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-22 08:59:51,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:51,611 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2019-10-22 08:59:51,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:51,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:51,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:51,617 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-10-22 08:59:51,638 INFO L375 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 17 treesize of output 9 [2019-10-22 08:59:51,638 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:51,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:51,642 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:51,643 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:16 [2019-10-22 08:59:51,672 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2019-10-22 08:59:51,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:51,676 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:51,677 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:51,677 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-10-22 08:59:51,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:59:51,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:59:51,755 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:51,755 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 33 [2019-10-22 08:59:51,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:51,773 INFO L567 ElimStorePlain]: treesize reduction 10, result has 75.0 percent of original size [2019-10-22 08:59:51,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:51,775 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-22 08:59:51,776 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-10-22 08:59:51,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:51,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:51,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:51,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:51,944 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:51,944 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:59:51,944 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2019-10-22 08:59:51,944 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576795537] [2019-10-22 08:59:51,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-22 08:59:51,945 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:51,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-22 08:59:51,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2019-10-22 08:59:51,945 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 21 states. [2019-10-22 08:59:52,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:52,604 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-10-22 08:59:52,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-22 08:59:52,605 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 31 [2019-10-22 08:59:52,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:52,605 INFO L225 Difference]: With dead ends: 44 [2019-10-22 08:59:52,605 INFO L226 Difference]: Without dead ends: 44 [2019-10-22 08:59:52,606 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=184, Invalid=1006, Unknown=0, NotChecked=0, Total=1190 [2019-10-22 08:59:52,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-22 08:59:52,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2019-10-22 08:59:52,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-22 08:59:52,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-10-22 08:59:52,608 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 31 [2019-10-22 08:59:52,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:52,608 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-10-22 08:59:52,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-22 08:59:52,608 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-10-22 08:59:52,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 08:59:52,609 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:52,609 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:52,810 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:52,810 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION]=== [2019-10-22 08:59:52,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:52,811 INFO L82 PathProgramCache]: Analyzing trace with hash 490747930, now seen corresponding path program 1 times [2019-10-22 08:59:52,811 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:52,811 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105447073] [2019-10-22 08:59:52,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:52,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:52,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:52,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:52,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:53,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:53,098 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105447073] [2019-10-22 08:59:53,098 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79254384] [2019-10-22 08:59:53,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b6a9a19-2567-445e-9a20-08b77ce18915/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:53,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 45 conjunts are in the unsatisfiable core [2019-10-22 08:59:53,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:53,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:59:53,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:59:53,246 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-22 08:59:53,246 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:53,254 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:53,257 INFO L375 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 7 treesize of output 3 [2019-10-22 08:59:53,258 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:53,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:53,264 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:53,264 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:7 [2019-10-22 08:59:53,396 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2019-10-22 08:59:53,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:53,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:53,403 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:53,403 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:41 [2019-10-22 08:59:53,435 INFO L375 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 61 treesize of output 45 [2019-10-22 08:59:53,435 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:59:53,448 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:53,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:59:53,448 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:78, output treesize:62 [2019-10-22 08:59:53,485 INFO L375 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 48 treesize of output 32 [2019-10-22 08:59:53,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:53,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:53,495 INFO L496 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. [2019-10-22 08:59:53,495 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:66, output treesize:47 [2019-10-22 08:59:53,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:53,560 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:59:53,560 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2019-10-22 08:59:53,560 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600612946] [2019-10-22 08:59:53,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-22 08:59:53,561 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:53,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-22 08:59:53,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2019-10-22 08:59:53,561 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 24 states. [2019-10-22 08:59:54,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:54,023 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2019-10-22 08:59:54,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-22 08:59:54,024 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2019-10-22 08:59:54,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:54,025 INFO L225 Difference]: With dead ends: 50 [2019-10-22 08:59:54,025 INFO L226 Difference]: Without dead ends: 41 [2019-10-22 08:59:54,025 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=794, Unknown=0, NotChecked=0, Total=930 [2019-10-22 08:59:54,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-22 08:59:54,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-10-22 08:59:54,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-22 08:59:54,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-10-22 08:59:54,027 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 31 [2019-10-22 08:59:54,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:54,027 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-10-22 08:59:54,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-22 08:59:54,028 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-10-22 08:59:54,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-22 08:59:54,029 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:54,029 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:54,230 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:54,230 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION]=== [2019-10-22 08:59:54,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:54,230 INFO L82 PathProgramCache]: Analyzing trace with hash -419622911, now seen corresponding path program 2 times [2019-10-22 08:59:54,231 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:54,231 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157318778] [2019-10-22 08:59:54,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:54,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:54,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:54,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:54,758 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:59:54,758 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157318778] [2019-10-22 08:59:54,758 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45045259] [2019-10-22 08:59:54,758 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b6a9a19-2567-445e-9a20-08b77ce18915/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:54,866 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 08:59:54,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:59:54,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 59 conjunts are in the unsatisfiable core [2019-10-22 08:59:54,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:54,907 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:54,907 INFO L375 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-10-22 08:59:54,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:54,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:54,917 INFO L375 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 8 treesize of output 4 [2019-10-22 08:59:54,917 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:54,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:54,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:54,922 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:7 [2019-10-22 08:59:55,036 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2019-10-22 08:59:55,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:55,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:55,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:55,045 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:47 [2019-10-22 08:59:55,093 INFO L375 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 48 treesize of output 32 [2019-10-22 08:59:55,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:55,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:55,100 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:55,100 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:35 [2019-10-22 08:59:55,132 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 [2019-10-22 08:59:55,132 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:55,135 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:55,136 INFO L464 ElimStorePlain]: Eliminatee |v_old(#memory_$Pointer$.base)_BEFORE_CALL_3| vanished before elimination [2019-10-22 08:59:55,136 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:55,136 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:19, output treesize:3 [2019-10-22 08:59:55,226 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2019-10-22 08:59:55,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:55,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:55,237 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:59:55,238 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:55 [2019-10-22 08:59:55,305 INFO L375 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 73 treesize of output 57 [2019-10-22 08:59:55,306 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:59:55,325 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:55,326 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-22 08:59:55,326 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:87, output treesize:71 [2019-10-22 08:59:55,382 INFO L375 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 45 treesize of output 33 [2019-10-22 08:59:55,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:55,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:55,403 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-22 08:59:55,404 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:60 [2019-10-22 08:59:55,561 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:59:55,561 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:59:55,561 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 33 [2019-10-22 08:59:55,561 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285859708] [2019-10-22 08:59:55,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-22 08:59:55,562 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:55,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-22 08:59:55,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1013, Unknown=0, NotChecked=0, Total=1122 [2019-10-22 08:59:55,563 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 34 states. [2019-10-22 08:59:56,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:56,429 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2019-10-22 08:59:56,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-22 08:59:56,430 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 41 [2019-10-22 08:59:56,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:56,430 INFO L225 Difference]: With dead ends: 38 [2019-10-22 08:59:56,430 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 08:59:56,431 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=200, Invalid=1606, Unknown=0, NotChecked=0, Total=1806 [2019-10-22 08:59:56,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 08:59:56,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 08:59:56,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 08:59:56,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 08:59:56,431 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2019-10-22 08:59:56,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:56,431 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:56,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-22 08:59:56,431 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:59:56,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 08:59:56,632 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:56,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:59:56 BoogieIcfgContainer [2019-10-22 08:59:56,635 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:59:56,635 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:59:56,636 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:59:56,636 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:59:56,636 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:42" (3/4) ... [2019-10-22 08:59:56,639 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 08:59:56,644 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-10-22 08:59:56,644 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_realloc [2019-10-22 08:59:56,644 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-10-22 08:59:56,644 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-10-22 08:59:56,645 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure expandArray [2019-10-22 08:59:56,645 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-10-22 08:59:56,648 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-10-22 08:59:56,648 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-10-22 08:59:56,648 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-10-22 08:59:56,648 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-10-22 08:59:56,682 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3b6a9a19-2567-445e-9a20-08b77ce18915/bin/uautomizer/witness.graphml [2019-10-22 08:59:56,682 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:59:56,683 INFO L168 Benchmark]: Toolchain (without parser) took 15409.75 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 402.7 MB). Free memory was 939.1 MB in the beginning and 845.4 MB in the end (delta: 93.7 MB). Peak memory consumption was 496.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:56,683 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:56,684 INFO L168 Benchmark]: CACSL2BoogieTranslator took 469.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -206.2 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:56,684 INFO L168 Benchmark]: Boogie Preprocessor took 69.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:56,684 INFO L168 Benchmark]: RCFGBuilder took 674.63 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: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:56,685 INFO L168 Benchmark]: TraceAbstraction took 14145.87 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 234.4 MB). Free memory was 1.1 GB in the beginning and 860.1 MB in the end (delta: 227.4 MB). Peak memory consumption was 461.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:56,685 INFO L168 Benchmark]: Witness Printer took 46.74 ms. Allocated memory is still 1.4 GB. Free memory was 860.1 MB in the beginning and 845.4 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:56,686 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 469.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -206.2 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 674.63 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: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14145.87 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 234.4 MB). Free memory was 1.1 GB in the beginning and 860.1 MB in the end (delta: 227.4 MB). Peak memory consumption was 461.8 MB. Max. memory is 11.5 GB. * Witness Printer took 46.74 ms. Allocated memory is still 1.4 GB. Free memory was 860.1 MB in the beginning and 845.4 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 581]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 576]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 581]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 576]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 562]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 562]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 53 locations, 14 error locations. Result: SAFE, OverallTime: 14.0s, OverallIterations: 21, TraceHistogramMax: 2, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 579 SDtfs, 614 SDslu, 1966 SDs, 0 SdLazy, 3662 SolverSat, 314 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 564 GetRequests, 258 SyntacticMatches, 7 SemanticMatches, 299 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1167 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 54 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 699 NumberOfCodeBlocks, 699 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 670 ConstructedInterpolants, 38 QuantifiedInterpolants, 211492 SizeOfPredicates, 57 NumberOfNonLiveVariables, 1861 ConjunctsInSsa, 204 ConjunctsInUnsatCore, 29 InterpolantComputations, 13 PerfectInterpolantSequences, 25/74 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...