./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0da5930d-4d7d-465f-a6d8-745ea5162782/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0da5930d-4d7d-465f-a6d8-745ea5162782/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0da5930d-4d7d-465f-a6d8-745ea5162782/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0da5930d-4d7d-465f-a6d8-745ea5162782/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0da5930d-4d7d-465f-a6d8-745ea5162782/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0da5930d-4d7d-465f-a6d8-745ea5162782/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 573d04c3ab16ffed1ccac6c6179d92b670a825d7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 10:51:15,684 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:51:15,685 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:51:15,692 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:51:15,692 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:51:15,693 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:51:15,694 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:51:15,695 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:51:15,697 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:51:15,698 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:51:15,698 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:51:15,699 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:51:15,699 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:51:15,700 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:51:15,701 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:51:15,701 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:51:15,702 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:51:15,703 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:51:15,704 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:51:15,706 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:51:15,707 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:51:15,707 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:51:15,708 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:51:15,708 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:51:15,710 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:51:15,710 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:51:15,710 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:51:15,711 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:51:15,711 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:51:15,712 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:51:15,712 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:51:15,712 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:51:15,713 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:51:15,713 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:51:15,714 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:51:15,714 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:51:15,715 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:51:15,715 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:51:15,715 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:51:15,716 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:51:15,717 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:51:15,717 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0da5930d-4d7d-465f-a6d8-745ea5162782/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-12-07 10:51:15,728 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:51:15,729 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:51:15,729 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:51:15,729 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:51:15,730 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:51:15,730 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:51:15,730 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:51:15,730 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 10:51:15,730 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:51:15,730 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:51:15,730 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:51:15,731 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 10:51:15,731 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 10:51:15,731 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:51:15,731 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 10:51:15,731 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:51:15,731 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:51:15,731 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:51:15,731 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:51:15,731 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:51:15,732 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:51:15,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:51:15,732 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:51:15,732 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:51:15,732 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:51:15,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:51:15,732 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:51:15,733 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/run_dir_0da5930d-4d7d-465f-a6d8-745ea5162782/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-memcleanup) ) 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 -> 573d04c3ab16ffed1ccac6c6179d92b670a825d7 [2019-12-07 10:51:15,831 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:51:15,842 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:51:15,845 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:51:15,846 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:51:15,846 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:51:15,847 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0da5930d-4d7d-465f-a6d8-745ea5162782/bin/uautomizer/../../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2019-12-07 10:51:15,894 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0da5930d-4d7d-465f-a6d8-745ea5162782/bin/uautomizer/data/ed0053e0b/0730d0250c3f4aafab83becc2ed87822/FLAGefcd33440 [2019-12-07 10:51:16,267 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:51:16,268 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0da5930d-4d7d-465f-a6d8-745ea5162782/sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2019-12-07 10:51:16,280 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0da5930d-4d7d-465f-a6d8-745ea5162782/bin/uautomizer/data/ed0053e0b/0730d0250c3f4aafab83becc2ed87822/FLAGefcd33440 [2019-12-07 10:51:16,289 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0da5930d-4d7d-465f-a6d8-745ea5162782/bin/uautomizer/data/ed0053e0b/0730d0250c3f4aafab83becc2ed87822 [2019-12-07 10:51:16,290 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:51:16,291 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 10:51:16,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:51:16,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:51:16,294 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:51:16,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:51:16" (1/1) ... [2019-12-07 10:51:16,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b8e19d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:51:16, skipping insertion in model container [2019-12-07 10:51:16,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:51:16" (1/1) ... [2019-12-07 10:51:16,301 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:51:16,325 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:51:16,528 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:51:16,534 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:51:16,563 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:51:16,594 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:51:16,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:51:16 WrapperNode [2019-12-07 10:51:16,595 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:51:16,595 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:51:16,595 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:51:16,595 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:51:16,603 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:51:16" (1/1) ... [2019-12-07 10:51:16,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:51:16" (1/1) ... [2019-12-07 10:51:16,614 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:51:16" (1/1) ... [2019-12-07 10:51:16,614 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:51:16" (1/1) ... [2019-12-07 10:51:16,625 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:51:16" (1/1) ... [2019-12-07 10:51:16,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:51:16" (1/1) ... [2019-12-07 10:51:16,631 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:51:16" (1/1) ... [2019-12-07 10:51:16,635 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:51:16,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:51:16,636 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:51:16,636 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:51:16,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:51:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0da5930d-4d7d-465f-a6d8-745ea5162782/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-12-07 10:51:16,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 10:51:16,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:51:16,674 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-07 10:51:16,674 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-07 10:51:16,675 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-12-07 10:51:16,675 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2019-12-07 10:51:16,675 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 10:51:16,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-12-07 10:51:16,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-07 10:51:16,675 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-07 10:51:16,675 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-07 10:51:16,675 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 10:51:16,675 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 10:51:16,675 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 10:51:16,675 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 10:51:16,676 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 10:51:16,676 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 10:51:16,676 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 10:51:16,676 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 10:51:16,676 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 10:51:16,676 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 10:51:16,676 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 10:51:16,676 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 10:51:16,676 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 10:51:16,676 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 10:51:16,676 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 10:51:16,676 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 10:51:16,677 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 10:51:16,677 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 10:51:16,677 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 10:51:16,677 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 10:51:16,677 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 10:51:16,677 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 10:51:16,677 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 10:51:16,677 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 10:51:16,677 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 10:51:16,677 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 10:51:16,677 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 10:51:16,677 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 10:51:16,677 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 10:51:16,678 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 10:51:16,678 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 10:51:16,678 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 10:51:16,678 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 10:51:16,678 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 10:51:16,678 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 10:51:16,678 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 10:51:16,678 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 10:51:16,678 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 10:51:16,678 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 10:51:16,678 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 10:51:16,678 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 10:51:16,678 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 10:51:16,678 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 10:51:16,679 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 10:51:16,679 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 10:51:16,679 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 10:51:16,679 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 10:51:16,679 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 10:51:16,679 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 10:51:16,679 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 10:51:16,679 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 10:51:16,679 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 10:51:16,679 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 10:51:16,679 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 10:51:16,679 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-12-07 10:51:16,679 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 10:51:16,679 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 10:51:16,680 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 10:51:16,680 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 10:51:16,680 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 10:51:16,680 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 10:51:16,680 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 10:51:16,680 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 10:51:16,680 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 10:51:16,680 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 10:51:16,680 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 10:51:16,680 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 10:51:16,680 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 10:51:16,680 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 10:51:16,680 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 10:51:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 10:51:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 10:51:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 10:51:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 10:51:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 10:51:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 10:51:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 10:51:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 10:51:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 10:51:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 10:51:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 10:51:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 10:51:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 10:51:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 10:51:16,682 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 10:51:16,682 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 10:51:16,682 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 10:51:16,682 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 10:51:16,682 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 10:51:16,682 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 10:51:16,682 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 10:51:16,682 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 10:51:16,682 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 10:51:16,682 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 10:51:16,682 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 10:51:16,682 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 10:51:16,682 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 10:51:16,682 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 10:51:16,683 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 10:51:16,683 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 10:51:16,683 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 10:51:16,683 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 10:51:16,683 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 10:51:16,683 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-12-07 10:51:16,683 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2019-12-07 10:51:16,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 10:51:16,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:51:16,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 10:51:16,683 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 10:51:16,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 10:51:16,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 10:51:16,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:51:16,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 10:51:16,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:51:16,843 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-12-07 10:51:17,006 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:51:17,007 INFO L287 CfgBuilder]: Removed 3 assume(true) statements. [2019-12-07 10:51:17,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:51:17 BoogieIcfgContainer [2019-12-07 10:51:17,008 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:51:17,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:51:17,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:51:17,010 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:51:17,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:51:16" (1/3) ... [2019-12-07 10:51:17,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc3881b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:51:17, skipping insertion in model container [2019-12-07 10:51:17,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:51:16" (2/3) ... [2019-12-07 10:51:17,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc3881b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:51:17, skipping insertion in model container [2019-12-07 10:51:17,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:51:17" (3/3) ... [2019-12-07 10:51:17,012 INFO L109 eAbstractionObserver]: Analyzing ICFG dll_nullified-1.i [2019-12-07 10:51:17,018 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:51:17,023 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 35 error locations. [2019-12-07 10:51:17,031 INFO L249 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2019-12-07 10:51:17,042 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:51:17,042 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 10:51:17,043 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:51:17,043 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:51:17,043 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:51:17,043 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:51:17,043 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:51:17,043 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:51:17,054 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states. [2019-12-07 10:51:17,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 10:51:17,060 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:51:17,060 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:51:17,061 INFO L410 AbstractCegarLoop]: === Iteration 1 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 10:51:17,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:51:17,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1636155626, now seen corresponding path program 1 times [2019-12-07 10:51:17,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:51:17,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427857186] [2019-12-07 10:51:17,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:51:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:17,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:51:17,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427857186] [2019-12-07 10:51:17,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:51:17,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:51:17,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138236033] [2019-12-07 10:51:17,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:51:17,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:51:17,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:51:17,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:51:17,216 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 4 states. [2019-12-07 10:51:17,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:51:17,437 INFO L93 Difference]: Finished difference Result 154 states and 172 transitions. [2019-12-07 10:51:17,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:51:17,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 10:51:17,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:51:17,446 INFO L225 Difference]: With dead ends: 154 [2019-12-07 10:51:17,447 INFO L226 Difference]: Without dead ends: 146 [2019-12-07 10:51:17,448 INFO L630 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-12-07 10:51:17,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-12-07 10:51:17,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 108. [2019-12-07 10:51:17,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-12-07 10:51:17,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 132 transitions. [2019-12-07 10:51:17,479 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 132 transitions. Word has length 11 [2019-12-07 10:51:17,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:51:17,479 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 132 transitions. [2019-12-07 10:51:17,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:51:17,480 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 132 transitions. [2019-12-07 10:51:17,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 10:51:17,480 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:51:17,480 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:51:17,480 INFO L410 AbstractCegarLoop]: === Iteration 2 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 10:51:17,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:51:17,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1636155627, now seen corresponding path program 1 times [2019-12-07 10:51:17,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:51:17,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376385685] [2019-12-07 10:51:17,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:51:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:17,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:51:17,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376385685] [2019-12-07 10:51:17,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:51:17,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:51:17,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556989832] [2019-12-07 10:51:17,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:51:17,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:51:17,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:51:17,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:51:17,535 INFO L87 Difference]: Start difference. First operand 108 states and 132 transitions. Second operand 4 states. [2019-12-07 10:51:17,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:51:17,700 INFO L93 Difference]: Finished difference Result 141 states and 157 transitions. [2019-12-07 10:51:17,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:51:17,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 10:51:17,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:51:17,702 INFO L225 Difference]: With dead ends: 141 [2019-12-07 10:51:17,702 INFO L226 Difference]: Without dead ends: 141 [2019-12-07 10:51:17,702 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:51:17,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-12-07 10:51:17,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 103. [2019-12-07 10:51:17,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-12-07 10:51:17,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 127 transitions. [2019-12-07 10:51:17,710 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 127 transitions. Word has length 11 [2019-12-07 10:51:17,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:51:17,710 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 127 transitions. [2019-12-07 10:51:17,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:51:17,710 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2019-12-07 10:51:17,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 10:51:17,711 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:51:17,711 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:51:17,711 INFO L410 AbstractCegarLoop]: === Iteration 3 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 10:51:17,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:51:17,711 INFO L82 PathProgramCache]: Analyzing trace with hash -892508750, now seen corresponding path program 1 times [2019-12-07 10:51:17,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:51:17,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939026574] [2019-12-07 10:51:17,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:51:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:17,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:51:17,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939026574] [2019-12-07 10:51:17,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:51:17,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:51:17,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880193972] [2019-12-07 10:51:17,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:51:17,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:51:17,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:51:17,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:51:17,774 INFO L87 Difference]: Start difference. First operand 103 states and 127 transitions. Second operand 7 states. [2019-12-07 10:51:17,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:51:17,966 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2019-12-07 10:51:17,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:51:17,966 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-12-07 10:51:17,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:51:17,967 INFO L225 Difference]: With dead ends: 101 [2019-12-07 10:51:17,967 INFO L226 Difference]: Without dead ends: 98 [2019-12-07 10:51:17,968 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:51:17,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-07 10:51:17,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 84. [2019-12-07 10:51:17,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-07 10:51:17,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2019-12-07 10:51:17,973 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 14 [2019-12-07 10:51:17,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:51:17,973 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2019-12-07 10:51:17,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:51:17,973 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2019-12-07 10:51:17,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 10:51:17,973 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:51:17,974 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:51:17,974 INFO L410 AbstractCegarLoop]: === Iteration 4 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 10:51:17,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:51:17,974 INFO L82 PathProgramCache]: Analyzing trace with hash 220783085, now seen corresponding path program 1 times [2019-12-07 10:51:17,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:51:17,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847038700] [2019-12-07 10:51:17,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:51:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:18,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:51:18,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847038700] [2019-12-07 10:51:18,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:51:18,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:51:18,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834347049] [2019-12-07 10:51:18,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:51:18,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:51:18,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:51:18,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:51:18,025 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 4 states. [2019-12-07 10:51:18,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:51:18,119 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2019-12-07 10:51:18,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:51:18,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 10:51:18,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:51:18,120 INFO L225 Difference]: With dead ends: 95 [2019-12-07 10:51:18,120 INFO L226 Difference]: Without dead ends: 95 [2019-12-07 10:51:18,120 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:51:18,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-12-07 10:51:18,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-12-07 10:51:18,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-07 10:51:18,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2019-12-07 10:51:18,125 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 20 [2019-12-07 10:51:18,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:51:18,125 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2019-12-07 10:51:18,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:51:18,125 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2019-12-07 10:51:18,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 10:51:18,126 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:51:18,126 INFO L410 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] [2019-12-07 10:51:18,126 INFO L410 AbstractCegarLoop]: === Iteration 5 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 10:51:18,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:51:18,127 INFO L82 PathProgramCache]: Analyzing trace with hash -753815674, now seen corresponding path program 1 times [2019-12-07 10:51:18,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:51:18,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414887189] [2019-12-07 10:51:18,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:51:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:18,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:51:18,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414887189] [2019-12-07 10:51:18,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:51:18,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 10:51:18,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939561338] [2019-12-07 10:51:18,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:51:18,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:51:18,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:51:18,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:51:18,214 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 9 states. [2019-12-07 10:51:18,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:51:18,448 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2019-12-07 10:51:18,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:51:18,448 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-12-07 10:51:18,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:51:18,449 INFO L225 Difference]: With dead ends: 94 [2019-12-07 10:51:18,449 INFO L226 Difference]: Without dead ends: 94 [2019-12-07 10:51:18,449 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:51:18,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-07 10:51:18,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2019-12-07 10:51:18,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-12-07 10:51:18,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2019-12-07 10:51:18,453 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 26 [2019-12-07 10:51:18,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:51:18,453 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2019-12-07 10:51:18,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:51:18,453 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2019-12-07 10:51:18,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 10:51:18,454 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:51:18,454 INFO L410 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] [2019-12-07 10:51:18,454 INFO L410 AbstractCegarLoop]: === Iteration 6 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 10:51:18,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:51:18,455 INFO L82 PathProgramCache]: Analyzing trace with hash -753815673, now seen corresponding path program 1 times [2019-12-07 10:51:18,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:51:18,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940940368] [2019-12-07 10:51:18,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:51:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:18,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:51:18,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940940368] [2019-12-07 10:51:18,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719328405] [2019-12-07 10:51:18,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0da5930d-4d7d-465f-a6d8-745ea5162782/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-12-07 10:51:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:18,598 INFO L264 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 10:51:18,602 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:51:18,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:51:18,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:51:18,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-12-07 10:51:18,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069099504] [2019-12-07 10:51:18,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:51:18,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:51:18,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:51:18,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:51:18,632 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand 9 states. [2019-12-07 10:51:18,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:51:18,790 INFO L93 Difference]: Finished difference Result 106 states and 121 transitions. [2019-12-07 10:51:18,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 10:51:18,790 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-12-07 10:51:18,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:51:18,791 INFO L225 Difference]: With dead ends: 106 [2019-12-07 10:51:18,791 INFO L226 Difference]: Without dead ends: 103 [2019-12-07 10:51:18,792 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:51:18,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-12-07 10:51:18,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 90. [2019-12-07 10:51:18,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-12-07 10:51:18,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2019-12-07 10:51:18,797 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 26 [2019-12-07 10:51:18,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:51:18,797 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2019-12-07 10:51:18,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:51:18,797 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2019-12-07 10:51:18,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 10:51:18,798 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:51:18,798 INFO L410 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] [2019-12-07 10:51:18,999 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:51:19,000 INFO L410 AbstractCegarLoop]: === Iteration 7 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 10:51:19,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:51:19,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1207663810, now seen corresponding path program 1 times [2019-12-07 10:51:19,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:51:19,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909592804] [2019-12-07 10:51:19,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:51:19,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:19,151 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:51:19,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909592804] [2019-12-07 10:51:19,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169477337] [2019-12-07 10:51:19,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0da5930d-4d7d-465f-a6d8-745ea5162782/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-12-07 10:51:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:19,223 INFO L264 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 10:51:19,225 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:51:19,250 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 10:51:19,251 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:19,254 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:19,255 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:51:19,255 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 10:51:19,301 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:19,302 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-12-07 10:51:19,303 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:19,317 INFO L614 ElimStorePlain]: treesize reduction 14, result has 57.6 percent of original size [2019-12-07 10:51:19,317 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:51:19,317 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:19 [2019-12-07 10:51:19,329 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:51:19,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:51:19,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-12-07 10:51:19,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029773061] [2019-12-07 10:51:19,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:51:19,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:51:19,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:51:19,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:51:19,330 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand 8 states. [2019-12-07 10:51:19,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:51:19,490 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2019-12-07 10:51:19,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:51:19,491 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-12-07 10:51:19,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:51:19,491 INFO L225 Difference]: With dead ends: 89 [2019-12-07 10:51:19,491 INFO L226 Difference]: Without dead ends: 89 [2019-12-07 10:51:19,492 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:51:19,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-07 10:51:19,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-12-07 10:51:19,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-12-07 10:51:19,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 102 transitions. [2019-12-07 10:51:19,495 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 102 transitions. Word has length 32 [2019-12-07 10:51:19,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:51:19,495 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 102 transitions. [2019-12-07 10:51:19,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:51:19,495 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2019-12-07 10:51:19,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 10:51:19,496 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:51:19,496 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:51:19,696 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:51:19,697 INFO L410 AbstractCegarLoop]: === Iteration 8 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 10:51:19,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:51:19,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1991367515, now seen corresponding path program 2 times [2019-12-07 10:51:19,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:51:19,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674970418] [2019-12-07 10:51:19,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:51:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:19,771 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:51:19,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674970418] [2019-12-07 10:51:19,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777768100] [2019-12-07 10:51:19,772 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0da5930d-4d7d-465f-a6d8-745ea5162782/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-12-07 10:51:19,852 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 10:51:19,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:51:19,853 INFO L264 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 10:51:19,855 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:51:19,904 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:51:19,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:51:19,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-12-07 10:51:19,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992128464] [2019-12-07 10:51:19,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 10:51:19,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:51:19,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 10:51:19,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:51:19,906 INFO L87 Difference]: Start difference. First operand 89 states and 102 transitions. Second operand 12 states. [2019-12-07 10:51:20,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:51:20,182 INFO L93 Difference]: Finished difference Result 117 states and 131 transitions. [2019-12-07 10:51:20,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:51:20,183 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-12-07 10:51:20,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:51:20,184 INFO L225 Difference]: With dead ends: 117 [2019-12-07 10:51:20,184 INFO L226 Difference]: Without dead ends: 114 [2019-12-07 10:51:20,184 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2019-12-07 10:51:20,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-12-07 10:51:20,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2019-12-07 10:51:20,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-07 10:51:20,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2019-12-07 10:51:20,188 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 38 [2019-12-07 10:51:20,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:51:20,188 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2019-12-07 10:51:20,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 10:51:20,188 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2019-12-07 10:51:20,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 10:51:20,190 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:51:20,190 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:51:20,390 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:51:20,391 INFO L410 AbstractCegarLoop]: === Iteration 9 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 10:51:20,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:51:20,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1388539033, now seen corresponding path program 1 times [2019-12-07 10:51:20,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:51:20,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718290548] [2019-12-07 10:51:20,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:51:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:20,526 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:51:20,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718290548] [2019-12-07 10:51:20,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125331215] [2019-12-07 10:51:20,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0da5930d-4d7d-465f-a6d8-745ea5162782/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-12-07 10:51:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:20,605 INFO L264 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 10:51:20,607 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:51:20,623 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:51:20,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:51:20,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2019-12-07 10:51:20,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300847355] [2019-12-07 10:51:20,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 10:51:20,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:51:20,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 10:51:20,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:51:20,625 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand 11 states. [2019-12-07 10:51:20,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:51:20,789 INFO L93 Difference]: Finished difference Result 130 states and 145 transitions. [2019-12-07 10:51:20,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:51:20,789 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2019-12-07 10:51:20,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:51:20,791 INFO L225 Difference]: With dead ends: 130 [2019-12-07 10:51:20,791 INFO L226 Difference]: Without dead ends: 127 [2019-12-07 10:51:20,791 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:51:20,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-12-07 10:51:20,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-12-07 10:51:20,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-12-07 10:51:20,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2019-12-07 10:51:20,796 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 52 [2019-12-07 10:51:20,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:51:20,796 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2019-12-07 10:51:20,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 10:51:20,796 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2019-12-07 10:51:20,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 10:51:20,797 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:51:20,797 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:51:20,998 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:51:20,998 INFO L410 AbstractCegarLoop]: === Iteration 10 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 10:51:20,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:51:20,998 INFO L82 PathProgramCache]: Analyzing trace with hash 806592706, now seen corresponding path program 2 times [2019-12-07 10:51:20,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:51:20,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941726774] [2019-12-07 10:51:20,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:51:21,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:21,139 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:51:21,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941726774] [2019-12-07 10:51:21,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490395019] [2019-12-07 10:51:21,139 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0da5930d-4d7d-465f-a6d8-745ea5162782/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-12-07 10:51:21,231 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 10:51:21,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:51:21,232 INFO L264 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 10:51:21,235 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:51:21,252 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:51:21,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:51:21,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 12 [2019-12-07 10:51:21,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342180427] [2019-12-07 10:51:21,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 10:51:21,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:51:21,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 10:51:21,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:51:21,253 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand 12 states. [2019-12-07 10:51:21,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:51:21,409 INFO L93 Difference]: Finished difference Result 143 states and 159 transitions. [2019-12-07 10:51:21,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 10:51:21,409 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-07 10:51:21,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:51:21,410 INFO L225 Difference]: With dead ends: 143 [2019-12-07 10:51:21,410 INFO L226 Difference]: Without dead ends: 140 [2019-12-07 10:51:21,411 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:51:21,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-12-07 10:51:21,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 128. [2019-12-07 10:51:21,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-12-07 10:51:21,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 143 transitions. [2019-12-07 10:51:21,414 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 143 transitions. Word has length 65 [2019-12-07 10:51:21,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:51:21,414 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 143 transitions. [2019-12-07 10:51:21,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 10:51:21,414 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 143 transitions. [2019-12-07 10:51:21,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-07 10:51:21,415 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:51:21,415 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:51:21,615 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:51:21,616 INFO L410 AbstractCegarLoop]: === Iteration 11 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 10:51:21,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:51:21,616 INFO L82 PathProgramCache]: Analyzing trace with hash -810524857, now seen corresponding path program 3 times [2019-12-07 10:51:21,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:51:21,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558485063] [2019-12-07 10:51:21,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:51:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:21,743 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-12-07 10:51:21,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558485063] [2019-12-07 10:51:21,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:51:21,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 10:51:21,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542950765] [2019-12-07 10:51:21,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:51:21,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:51:21,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:51:21,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:51:21,745 INFO L87 Difference]: Start difference. First operand 128 states and 143 transitions. Second operand 9 states. [2019-12-07 10:51:22,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:51:22,008 INFO L93 Difference]: Finished difference Result 163 states and 183 transitions. [2019-12-07 10:51:22,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:51:22,008 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-12-07 10:51:22,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:51:22,009 INFO L225 Difference]: With dead ends: 163 [2019-12-07 10:51:22,009 INFO L226 Difference]: Without dead ends: 163 [2019-12-07 10:51:22,009 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:51:22,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-12-07 10:51:22,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 154. [2019-12-07 10:51:22,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-12-07 10:51:22,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 176 transitions. [2019-12-07 10:51:22,013 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 176 transitions. Word has length 78 [2019-12-07 10:51:22,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:51:22,013 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 176 transitions. [2019-12-07 10:51:22,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:51:22,014 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 176 transitions. [2019-12-07 10:51:22,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-07 10:51:22,014 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:51:22,014 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:51:22,015 INFO L410 AbstractCegarLoop]: === Iteration 12 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 10:51:22,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:51:22,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1237334442, now seen corresponding path program 1 times [2019-12-07 10:51:22,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:51:22,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159396923] [2019-12-07 10:51:22,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:51:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:22,152 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-12-07 10:51:22,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159396923] [2019-12-07 10:51:22,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:51:22,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 10:51:22,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501939622] [2019-12-07 10:51:22,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:51:22,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:51:22,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:51:22,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:51:22,154 INFO L87 Difference]: Start difference. First operand 154 states and 176 transitions. Second operand 9 states. [2019-12-07 10:51:22,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:51:22,349 INFO L93 Difference]: Finished difference Result 160 states and 180 transitions. [2019-12-07 10:51:22,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:51:22,349 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-12-07 10:51:22,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:51:22,350 INFO L225 Difference]: With dead ends: 160 [2019-12-07 10:51:22,350 INFO L226 Difference]: Without dead ends: 160 [2019-12-07 10:51:22,350 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:51:22,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-12-07 10:51:22,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2019-12-07 10:51:22,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-12-07 10:51:22,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 175 transitions. [2019-12-07 10:51:22,353 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 175 transitions. Word has length 82 [2019-12-07 10:51:22,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:51:22,354 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 175 transitions. [2019-12-07 10:51:22,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:51:22,354 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 175 transitions. [2019-12-07 10:51:22,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 10:51:22,355 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:51:22,355 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:51:22,355 INFO L410 AbstractCegarLoop]: === Iteration 13 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 10:51:22,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:51:22,355 INFO L82 PathProgramCache]: Analyzing trace with hash -168861462, now seen corresponding path program 1 times [2019-12-07 10:51:22,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:51:22,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533369453] [2019-12-07 10:51:22,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:51:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:22,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:22,613 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 10:51:22,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533369453] [2019-12-07 10:51:22,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163028922] [2019-12-07 10:51:22,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0da5930d-4d7d-465f-a6d8-745ea5162782/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-12-07 10:51:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:22,717 INFO L264 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-07 10:51:22,720 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:51:22,728 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:22,728 INFO L377 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 11 treesize of output 15 [2019-12-07 10:51:22,729 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:22,731 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:22,731 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:51:22,731 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-07 10:51:22,748 INFO L377 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-12-07 10:51:22,749 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:22,753 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:22,754 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:51:22,754 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-12-07 10:51:22,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:51:22,776 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 10:51:22,776 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:22,782 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:22,782 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:51:22,782 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-12-07 10:51:22,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:51:22,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:51:22,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:51:22,808 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-12-07 10:51:22,809 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:22,816 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:22,816 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:51:22,816 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:27 [2019-12-07 10:51:22,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:51:22,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:51:22,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:51:22,822 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-12-07 10:51:22,823 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:22,828 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:22,829 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:51:22,829 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:27 [2019-12-07 10:51:22,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:51:22,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:51:22,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:51:22,835 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-12-07 10:51:22,835 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:22,841 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:22,841 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:51:22,841 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:27 [2019-12-07 10:51:22,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:51:22,846 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-12-07 10:51:22,847 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:22,853 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:22,853 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:51:22,853 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:23 [2019-12-07 10:51:22,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:51:22,953 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:22,953 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 24 treesize of output 10 [2019-12-07 10:51:22,954 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:22,957 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:22,958 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:51:22,958 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-12-07 10:51:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 10:51:22,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:51:22,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 23 [2019-12-07 10:51:22,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200689468] [2019-12-07 10:51:22,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 10:51:22,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:51:22,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 10:51:22,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:51:22,970 INFO L87 Difference]: Start difference. First operand 154 states and 175 transitions. Second operand 23 states. [2019-12-07 10:51:23,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:51:23,636 INFO L93 Difference]: Finished difference Result 160 states and 179 transitions. [2019-12-07 10:51:23,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 10:51:23,636 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 86 [2019-12-07 10:51:23,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:51:23,637 INFO L225 Difference]: With dead ends: 160 [2019-12-07 10:51:23,637 INFO L226 Difference]: Without dead ends: 160 [2019-12-07 10:51:23,638 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 85 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=193, Invalid=1067, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 10:51:23,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-12-07 10:51:23,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2019-12-07 10:51:23,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-12-07 10:51:23,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 174 transitions. [2019-12-07 10:51:23,641 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 174 transitions. Word has length 86 [2019-12-07 10:51:23,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:51:23,641 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 174 transitions. [2019-12-07 10:51:23,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 10:51:23,641 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 174 transitions. [2019-12-07 10:51:23,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 10:51:23,642 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:51:23,642 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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-12-07 10:51:23,842 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:51:23,843 INFO L410 AbstractCegarLoop]: === Iteration 14 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 10:51:23,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:51:23,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1735285809, now seen corresponding path program 1 times [2019-12-07 10:51:23,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:51:23,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635068073] [2019-12-07 10:51:23,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:51:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:24,171 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 10:51:24,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635068073] [2019-12-07 10:51:24,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29400451] [2019-12-07 10:51:24,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0da5930d-4d7d-465f-a6d8-745ea5162782/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-12-07 10:51:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:24,267 INFO L264 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-07 10:51:24,269 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:51:24,277 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:24,277 INFO L377 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 11 treesize of output 15 [2019-12-07 10:51:24,277 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:24,280 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:24,280 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:51:24,280 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-07 10:51:24,304 INFO L377 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 13 treesize of output 9 [2019-12-07 10:51:24,304 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:24,308 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:24,308 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:51:24,308 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-12-07 10:51:24,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:51:24,313 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 10:51:24,313 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:24,318 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:24,318 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:51:24,318 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:17 [2019-12-07 10:51:24,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:51:24,322 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 10:51:24,322 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:24,326 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:24,326 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:51:24,326 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:17 [2019-12-07 10:51:24,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:51:24,331 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 10:51:24,331 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:24,335 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:24,335 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:51:24,336 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:17 [2019-12-07 10:51:24,339 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 10:51:24,340 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:24,343 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:24,344 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:51:24,344 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:13 [2019-12-07 10:51:24,364 INFO L377 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-12-07 10:51:24,364 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:24,365 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:24,365 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:51:24,365 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-12-07 10:51:24,374 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 10:51:24,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:51:24,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 17 [2019-12-07 10:51:24,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294578402] [2019-12-07 10:51:24,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 10:51:24,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:51:24,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 10:51:24,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-12-07 10:51:24,375 INFO L87 Difference]: Start difference. First operand 154 states and 174 transitions. Second operand 17 states. [2019-12-07 10:51:25,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:51:25,275 INFO L93 Difference]: Finished difference Result 160 states and 178 transitions. [2019-12-07 10:51:25,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 10:51:25,276 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 88 [2019-12-07 10:51:25,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:51:25,277 INFO L225 Difference]: With dead ends: 160 [2019-12-07 10:51:25,277 INFO L226 Difference]: Without dead ends: 160 [2019-12-07 10:51:25,277 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 92 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=639, Unknown=0, NotChecked=0, Total=756 [2019-12-07 10:51:25,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-12-07 10:51:25,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2019-12-07 10:51:25,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-12-07 10:51:25,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 173 transitions. [2019-12-07 10:51:25,281 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 173 transitions. Word has length 88 [2019-12-07 10:51:25,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:51:25,282 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 173 transitions. [2019-12-07 10:51:25,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 10:51:25,282 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 173 transitions. [2019-12-07 10:51:25,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 10:51:25,283 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:51:25,283 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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-12-07 10:51:25,483 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:51:25,484 INFO L410 AbstractCegarLoop]: === Iteration 15 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 10:51:25,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:51:25,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1702130661, now seen corresponding path program 1 times [2019-12-07 10:51:25,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:51:25,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481678287] [2019-12-07 10:51:25,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:51:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:25,745 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 10:51:25,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481678287] [2019-12-07 10:51:25,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005302502] [2019-12-07 10:51:25,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0da5930d-4d7d-465f-a6d8-745ea5162782/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-12-07 10:51:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:25,848 INFO L264 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-07 10:51:25,851 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:51:25,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:51:25,922 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:25,922 INFO L377 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 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 10:51:25,923 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:25,926 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:25,926 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:51:25,927 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2019-12-07 10:51:25,969 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 10:51:25,970 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:25,983 INFO L614 ElimStorePlain]: treesize reduction 5, result has 82.8 percent of original size [2019-12-07 10:51:25,983 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:51:25,983 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:24 [2019-12-07 10:51:26,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:51:26,017 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 10:51:26,017 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:26,025 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:26,025 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:51:26,025 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2019-12-07 10:51:26,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:51:26,079 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:26,079 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 110 [2019-12-07 10:51:26,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:51:26,081 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:26,099 INFO L614 ElimStorePlain]: treesize reduction 46, result has 52.6 percent of original size [2019-12-07 10:51:26,099 INFO L534 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-12-07 10:51:26,099 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:51 [2019-12-07 10:51:26,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:51:26,290 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:26,290 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 53 [2019-12-07 10:51:26,291 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:26,300 INFO L614 ElimStorePlain]: treesize reduction 16, result has 48.4 percent of original size [2019-12-07 10:51:26,300 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:51:26,300 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:11 [2019-12-07 10:51:26,339 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 79 proven. 12 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-12-07 10:51:26,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:51:26,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2019-12-07 10:51:26,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833438835] [2019-12-07 10:51:26,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 10:51:26,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:51:26,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 10:51:26,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2019-12-07 10:51:26,340 INFO L87 Difference]: Start difference. First operand 154 states and 173 transitions. Second operand 29 states. [2019-12-07 10:51:27,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:51:27,483 INFO L93 Difference]: Finished difference Result 143 states and 157 transitions. [2019-12-07 10:51:27,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 10:51:27,483 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 89 [2019-12-07 10:51:27,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:51:27,484 INFO L225 Difference]: With dead ends: 143 [2019-12-07 10:51:27,484 INFO L226 Difference]: Without dead ends: 143 [2019-12-07 10:51:27,485 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 81 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=279, Invalid=1701, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 10:51:27,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-12-07 10:51:27,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2019-12-07 10:51:27,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-12-07 10:51:27,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 155 transitions. [2019-12-07 10:51:27,488 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 155 transitions. Word has length 89 [2019-12-07 10:51:27,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:51:27,488 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 155 transitions. [2019-12-07 10:51:27,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-07 10:51:27,488 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 155 transitions. [2019-12-07 10:51:27,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-07 10:51:27,489 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:51:27,489 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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-12-07 10:51:27,689 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:51:27,690 INFO L410 AbstractCegarLoop]: === Iteration 16 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 10:51:27,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:51:27,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1160774828, now seen corresponding path program 1 times [2019-12-07 10:51:27,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:51:27,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491021603] [2019-12-07 10:51:27,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:51:27,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:51:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:51:27,800 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:51:27,800 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:51:27,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:51:27 BoogieIcfgContainer [2019-12-07 10:51:27,849 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:51:27,850 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:51:27,850 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:51:27,850 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:51:27,851 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:51:17" (3/4) ... [2019-12-07 10:51:27,852 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 10:51:27,902 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0da5930d-4d7d-465f-a6d8-745ea5162782/bin/uautomizer/witness.graphml [2019-12-07 10:51:27,902 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:51:27,903 INFO L168 Benchmark]: Toolchain (without parser) took 11611.62 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 259.0 MB). Free memory was 943.6 MB in the beginning and 853.4 MB in the end (delta: 90.2 MB). Peak memory consumption was 349.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:51:27,903 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 964.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:51:27,903 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 943.6 MB in the beginning and 1.1 GB in the end (delta: -141.9 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:51:27,903 INFO L168 Benchmark]: Boogie Preprocessor took 39.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:51:27,904 INFO L168 Benchmark]: RCFGBuilder took 372.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.7 MB). Peak memory consumption was 55.7 MB. Max. memory is 11.5 GB. [2019-12-07 10:51:27,904 INFO L168 Benchmark]: TraceAbstraction took 10841.29 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 152.0 MB). Free memory was 1.0 GB in the beginning and 865.0 MB in the end (delta: 154.0 MB). Peak memory consumption was 306.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:51:27,904 INFO L168 Benchmark]: Witness Printer took 51.97 ms. Allocated memory is still 1.3 GB. Free memory was 865.0 MB in the beginning and 853.4 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. [2019-12-07 10:51:27,905 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 964.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 303.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 943.6 MB in the beginning and 1.1 GB in the end (delta: -141.9 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 372.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.7 MB). Peak memory consumption was 55.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10841.29 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 152.0 MB). Free memory was 1.0 GB in the beginning and 865.0 MB in the end (delta: 154.0 MB). Peak memory consumption was 306.1 MB. Max. memory is 11.5 GB. * Witness Printer took 51.97 ms. Allocated memory is still 1.3 GB. Free memory was 865.0 MB in the beginning and 853.4 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 605]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L588] const int len = 5; VAL [len=5] [L589] CALL, EXPR dll_create(len) VAL [\old(len)=5] [L568] DLL head = ((void *)0); VAL [\old(len)=5, head={0:0}, len=5] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L574] new_head->data_0 = 0 VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L575] new_head->data_1 = 0 VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=5, __VERIFIER_nondet_int() == len? 1 : 0=1, head={0:0}, len=5, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=5, __VERIFIER_nondet_int() == len? 1 : 0=1, head={0:0}, len=5, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L577] new_head->next = head VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L579] COND FALSE !(\read(head)) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={-5:0}, len=4, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-5:0}, len=4, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-5:0}, len=4, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L574] new_head->data_0 = 0 VAL [\old(len)=5, head={-5:0}, len=4, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L575] new_head->data_1 = 0 VAL [\old(len)=5, head={-5:0}, len=4, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=4, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-5:0}, len=4, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=4, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-5:0}, len=4, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L577] new_head->next = head VAL [\old(len)=5, head={-5:0}, len=4, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-5:0}, len=4, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L579] COND TRUE \read(head) VAL [\old(len)=5, head={-5:0}, len=4, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L580] head->prev = new_head VAL [\old(len)=5, head={-5:0}, len=4, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={-3:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-3:0}, len=3, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-3:0}, len=3, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L574] new_head->data_0 = 0 VAL [\old(len)=5, head={-3:0}, len=3, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L575] new_head->data_1 = 0 VAL [\old(len)=5, head={-3:0}, len=3, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=3, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-3:0}, len=3, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=3, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-3:0}, len=3, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L577] new_head->next = head VAL [\old(len)=5, head={-3:0}, len=3, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-3:0}, len=3, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L579] COND TRUE \read(head) VAL [\old(len)=5, head={-3:0}, len=3, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L580] head->prev = new_head VAL [\old(len)=5, head={-3:0}, len=3, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={-4:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-4:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-4:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L574] new_head->data_0 = 0 VAL [\old(len)=5, head={-4:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L575] new_head->data_1 = 0 VAL [\old(len)=5, head={-4:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=2, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-4:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=2, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-4:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L577] new_head->next = head VAL [\old(len)=5, head={-4:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-4:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L579] COND TRUE \read(head) VAL [\old(len)=5, head={-4:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L580] head->prev = new_head VAL [\old(len)=5, head={-4:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={-2:0}, len=1, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-2:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-2:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L574] new_head->data_0 = 0 VAL [\old(len)=5, head={-2:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L575] new_head->data_1 = 0 VAL [\old(len)=5, head={-2:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-2:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-2:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L577] new_head->next = head VAL [\old(len)=5, head={-2:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-2:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L579] COND TRUE \read(head) VAL [\old(len)=5, head={-2:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L580] head->prev = new_head VAL [\old(len)=5, head={-2:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={-1:0}, len=0, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L569] COND FALSE !(len > 0) VAL [\old(len)=5, head={-1:0}, len=0, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L585] return head; VAL [\old(len)=5, \result={-1:0}, head={-1:0}, len=0, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L589] RET, EXPR dll_create(len) VAL [dll_create(len)={-1:0}, len=5] [L589] DLL head = dll_create(len); [L590] head->next VAL [head={-1:0}, head->next={-2:0}, len=5] [L590] COND TRUE head->next [L591] EXPR head->data_0 VAL [head={-1:0}, head->data_0=0, len=5] [L591] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-1:0}, head->data_0=0, len=5] [L591] EXPR head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-1:0}, head->data_0=0, head->data_1=0, len=5] [L591] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-1:0}, head->data_0=0, head->data_1=0, len=5] [L591] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=0, head={-1:0}, head->data_0=0, head->data_1=0, len=5] [L591] EXPR head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=0, head={-1:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L591] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=1, head={-1:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L591] COND TRUE 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L605] __VERIFIER_error() VAL [head={-1:0}, len=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 106 locations, 35 error locations. Result: UNSAFE, OverallTime: 10.7s, OverallIterations: 16, TraceHistogramMax: 5, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1035 SDtfs, 1333 SDslu, 5224 SDs, 0 SdLazy, 5002 SolverSat, 265 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 729 GetRequests, 497 SyntacticMatches, 20 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=154occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 176 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1284 NumberOfCodeBlocks, 1284 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1171 ConstructedInterpolants, 7 QuantifiedInterpolants, 375986 SizeOfPredicates, 59 NumberOfNonLiveVariables, 2446 ConjunctsInSsa, 163 ConjunctsInUnsatCore, 23 InterpolantComputations, 7 PerfectInterpolantSequences, 988/1339 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 incorrect! Received shutdown request...