./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 678e0110 Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_744ced4c-63e5-4dbd-b5e5-c113d1897e16/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_744ced4c-63e5-4dbd-b5e5-c113d1897e16/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_744ced4c-63e5-4dbd-b5e5-c113d1897e16/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_744ced4c-63e5-4dbd-b5e5-c113d1897e16/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_744ced4c-63e5-4dbd-b5e5-c113d1897e16/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_744ced4c-63e5-4dbd-b5e5-c113d1897e16/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 76d1c5e435c1ee1c0852e4a01b3ec32d520e70a3 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 06:45:21,739 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 06:45:21,741 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 06:45:21,755 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 06:45:21,756 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 06:45:21,757 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 06:45:21,759 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 06:45:21,767 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 06:45:21,771 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 06:45:21,775 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 06:45:21,776 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 06:45:21,777 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 06:45:21,777 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 06:45:21,779 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 06:45:21,781 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 06:45:21,782 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 06:45:21,783 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 06:45:21,783 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 06:45:21,786 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 06:45:21,789 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 06:45:21,792 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 06:45:21,794 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 06:45:21,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 06:45:21,797 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 06:45:21,801 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 06:45:21,801 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 06:45:21,802 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 06:45:21,803 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 06:45:21,804 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 06:45:21,804 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 06:45:21,805 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 06:45:21,805 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 06:45:21,806 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 06:45:21,807 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 06:45:21,807 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 06:45:21,808 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 06:45:21,808 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 06:45:21,808 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 06:45:21,809 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 06:45:21,809 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 06:45:21,810 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 06:45:21,811 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_744ced4c-63e5-4dbd-b5e5-c113d1897e16/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-20 06:45:21,834 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 06:45:21,843 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 06:45:21,844 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 06:45:21,845 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 06:45:21,845 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 06:45:21,845 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 06:45:21,845 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 06:45:21,846 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 06:45:21,846 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 06:45:21,846 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 06:45:21,846 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 06:45:21,846 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-20 06:45:21,847 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-20 06:45:21,847 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-20 06:45:21,847 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 06:45:21,847 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 06:45:21,847 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 06:45:21,848 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 06:45:21,848 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 06:45:21,848 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 06:45:21,848 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 06:45:21,849 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 06:45:21,849 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 06:45:21,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 06:45:21,849 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 06:45:21,849 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 06:45:21,850 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 06:45:21,850 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 06:45:21,850 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 06:45:21,850 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_744ced4c-63e5-4dbd-b5e5-c113d1897e16/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 76d1c5e435c1ee1c0852e4a01b3ec32d520e70a3 [2019-11-20 06:45:22,022 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 06:45:22,037 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 06:45:22,039 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 06:45:22,041 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 06:45:22,042 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 06:45:22,043 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_744ced4c-63e5-4dbd-b5e5-c113d1897e16/bin/uautomizer/../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2019-11-20 06:45:22,096 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_744ced4c-63e5-4dbd-b5e5-c113d1897e16/bin/uautomizer/data/464950207/0e5f7d7acf7c464aa23c0755c562b5f6/FLAG5e8dec4fc [2019-11-20 06:45:22,550 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 06:45:22,550 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_744ced4c-63e5-4dbd-b5e5-c113d1897e16/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2019-11-20 06:45:22,560 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_744ced4c-63e5-4dbd-b5e5-c113d1897e16/bin/uautomizer/data/464950207/0e5f7d7acf7c464aa23c0755c562b5f6/FLAG5e8dec4fc [2019-11-20 06:45:22,825 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_744ced4c-63e5-4dbd-b5e5-c113d1897e16/bin/uautomizer/data/464950207/0e5f7d7acf7c464aa23c0755c562b5f6 [2019-11-20 06:45:22,828 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 06:45:22,829 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-20 06:45:22,830 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 06:45:22,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 06:45:22,833 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 06:45:22,834 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:45:22" (1/1) ... [2019-11-20 06:45:22,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2caa7646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:22, skipping insertion in model container [2019-11-20 06:45:22,837 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:45:22" (1/1) ... [2019-11-20 06:45:22,844 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 06:45:22,898 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 06:45:23,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 06:45:23,348 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 06:45:23,412 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 06:45:23,481 INFO L192 MainTranslator]: Completed translation [2019-11-20 06:45:23,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:23 WrapperNode [2019-11-20 06:45:23,482 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 06:45:23,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 06:45:23,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 06:45:23,483 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 06:45:23,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:23" (1/1) ... [2019-11-20 06:45:23,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:23" (1/1) ... [2019-11-20 06:45:23,512 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:23" (1/1) ... [2019-11-20 06:45:23,513 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:23" (1/1) ... [2019-11-20 06:45:23,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:23" (1/1) ... [2019-11-20 06:45:23,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:23" (1/1) ... [2019-11-20 06:45:23,540 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:23" (1/1) ... [2019-11-20 06:45:23,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 06:45:23,548 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 06:45:23,548 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 06:45:23,548 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 06:45:23,549 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_744ced4c-63e5-4dbd-b5e5-c113d1897e16/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-11-20 06:45:23,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-20 06:45:23,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 06:45:23,596 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-20 06:45:23,596 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-20 06:45:23,596 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2019-11-20 06:45:23,596 INFO L138 BoogieDeclarations]: Found implementation of procedure freeData [2019-11-20 06:45:23,597 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-11-20 06:45:23,597 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-20 06:45:23,597 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-20 06:45:23,597 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-20 06:45:23,597 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-20 06:45:23,598 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-20 06:45:23,598 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-20 06:45:23,598 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-20 06:45:23,598 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-20 06:45:23,598 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-20 06:45:23,599 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-20 06:45:23,599 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-20 06:45:23,599 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-20 06:45:23,599 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-20 06:45:23,599 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-20 06:45:23,600 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-20 06:45:23,600 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-20 06:45:23,600 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-20 06:45:23,600 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-20 06:45:23,600 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-20 06:45:23,601 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-20 06:45:23,601 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-20 06:45:23,601 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-20 06:45:23,601 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-20 06:45:23,601 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-20 06:45:23,601 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-20 06:45:23,602 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-20 06:45:23,602 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-20 06:45:23,602 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-20 06:45:23,602 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-20 06:45:23,602 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-20 06:45:23,602 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-20 06:45:23,603 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-20 06:45:23,603 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-20 06:45:23,603 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-20 06:45:23,603 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-20 06:45:23,603 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-20 06:45:23,604 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-20 06:45:23,604 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-20 06:45:23,604 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-20 06:45:23,604 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-20 06:45:23,604 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-20 06:45:23,605 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-20 06:45:23,605 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-20 06:45:23,605 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-20 06:45:23,605 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-20 06:45:23,605 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-20 06:45:23,606 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-20 06:45:23,606 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-20 06:45:23,606 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-20 06:45:23,606 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-20 06:45:23,606 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-20 06:45:23,607 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-20 06:45:23,607 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-20 06:45:23,607 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-20 06:45:23,607 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-20 06:45:23,607 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-20 06:45:23,607 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-20 06:45:23,608 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-20 06:45:23,608 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-20 06:45:23,608 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-20 06:45:23,608 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-20 06:45:23,608 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-20 06:45:23,608 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-20 06:45:23,609 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-20 06:45:23,609 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-20 06:45:23,609 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-20 06:45:23,609 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-20 06:45:23,609 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-20 06:45:23,609 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-20 06:45:23,610 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-20 06:45:23,610 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-20 06:45:23,610 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-20 06:45:23,610 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-20 06:45:23,610 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-20 06:45:23,611 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-20 06:45:23,611 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-20 06:45:23,611 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-20 06:45:23,611 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-20 06:45:23,611 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-20 06:45:23,612 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-20 06:45:23,612 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-20 06:45:23,612 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-20 06:45:23,612 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-20 06:45:23,612 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-20 06:45:23,612 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-20 06:45:23,613 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-20 06:45:23,613 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-20 06:45:23,613 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-20 06:45:23,613 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-20 06:45:23,613 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-20 06:45:23,613 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-20 06:45:23,614 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-20 06:45:23,614 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-20 06:45:23,614 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-20 06:45:23,614 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-20 06:45:23,614 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-20 06:45:23,614 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-20 06:45:23,615 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-20 06:45:23,615 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-20 06:45:23,615 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-20 06:45:23,615 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-20 06:45:23,615 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-20 06:45:23,615 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-20 06:45:23,616 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-20 06:45:23,616 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-20 06:45:23,616 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-20 06:45:23,616 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-20 06:45:23,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-20 06:45:23,616 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2019-11-20 06:45:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 06:45:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 06:45:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 06:45:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 06:45:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure freeData [2019-11-20 06:45:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 06:45:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-11-20 06:45:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-20 06:45:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 06:45:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-20 06:45:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-20 06:45:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 06:45:23,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 06:45:24,416 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 06:45:24,416 INFO L285 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-20 06:45:24,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:45:24 BoogieIcfgContainer [2019-11-20 06:45:24,417 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 06:45:24,418 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 06:45:24,418 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 06:45:24,420 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 06:45:24,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:45:22" (1/3) ... [2019-11-20 06:45:24,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7560362f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:45:24, skipping insertion in model container [2019-11-20 06:45:24,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:23" (2/3) ... [2019-11-20 06:45:24,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7560362f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:45:24, skipping insertion in model container [2019-11-20 06:45:24,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:45:24" (3/3) ... [2019-11-20 06:45:24,425 INFO L109 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-1.i [2019-11-20 06:45:24,434 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 06:45:24,442 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 46 error locations. [2019-11-20 06:45:24,453 INFO L249 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2019-11-20 06:45:24,470 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 06:45:24,470 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-20 06:45:24,471 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 06:45:24,471 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 06:45:24,471 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 06:45:24,471 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 06:45:24,471 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 06:45:24,472 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 06:45:24,492 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2019-11-20 06:45:24,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-20 06:45:24,499 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:45:24,500 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:45:24,500 INFO L410 AbstractCegarLoop]: === Iteration 1 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 06:45:24,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:45:24,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1597989777, now seen corresponding path program 1 times [2019-11-20 06:45:24,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:45:24,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1432193143] [2019-11-20 06:45:24,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_744ced4c-63e5-4dbd-b5e5-c113d1897e16/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:45:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:45:24,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-20 06:45:24,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:45:24,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:45:24,705 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:45:24,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:45:24,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1432193143] [2019-11-20 06:45:24,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:45:24,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 06:45:24,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975421088] [2019-11-20 06:45:24,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 06:45:24,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:45:24,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 06:45:24,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 06:45:24,746 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 2 states. [2019-11-20 06:45:24,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:45:24,775 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2019-11-20 06:45:24,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 06:45:24,777 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-20 06:45:24,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:45:24,798 INFO L225 Difference]: With dead ends: 110 [2019-11-20 06:45:24,798 INFO L226 Difference]: Without dead ends: 107 [2019-11-20 06:45:24,800 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 06:45:24,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-20 06:45:24,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-20 06:45:24,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-20 06:45:24,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2019-11-20 06:45:24,852 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 8 [2019-11-20 06:45:24,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:45:24,853 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2019-11-20 06:45:24,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 06:45:24,853 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2019-11-20 06:45:24,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 06:45:24,854 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:45:24,854 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:45:25,066 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:45:25,066 INFO L410 AbstractCegarLoop]: === Iteration 2 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 06:45:25,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:45:25,066 INFO L82 PathProgramCache]: Analyzing trace with hash -2001857581, now seen corresponding path program 1 times [2019-11-20 06:45:25,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:45:25,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1286592076] [2019-11-20 06:45:25,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_744ced4c-63e5-4dbd-b5e5-c113d1897e16/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:45:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:45:25,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 06:45:25,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:45:25,275 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-11-20 06:45:25,281 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:45:25,284 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:45:25,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:45:25,285 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 06:45:25,337 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:45:25,338 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 14 treesize of output 30 [2019-11-20 06:45:25,340 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:45:25,361 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-20 06:45:25,362 INFO L496 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-11-20 06:45:25,362 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-20 06:45:25,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:45:25,388 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:45:25,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:45:25,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1286592076] [2019-11-20 06:45:25,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:45:25,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 06:45:25,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870913913] [2019-11-20 06:45:25,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 06:45:25,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:45:25,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 06:45:25,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 06:45:25,417 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 5 states. [2019-11-20 06:45:25,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:45:25,960 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2019-11-20 06:45:25,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 06:45:25,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-20 06:45:25,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:45:25,965 INFO L225 Difference]: With dead ends: 116 [2019-11-20 06:45:25,965 INFO L226 Difference]: Without dead ends: 116 [2019-11-20 06:45:25,966 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 06:45:25,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-20 06:45:25,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2019-11-20 06:45:25,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-20 06:45:25,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2019-11-20 06:45:25,997 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 9 [2019-11-20 06:45:25,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:45:25,997 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2019-11-20 06:45:25,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 06:45:25,998 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2019-11-20 06:45:25,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 06:45:25,998 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:45:25,998 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:45:26,210 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:45:26,210 INFO L410 AbstractCegarLoop]: === Iteration 3 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 06:45:26,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:45:26,211 INFO L82 PathProgramCache]: Analyzing trace with hash -2001857580, now seen corresponding path program 1 times [2019-11-20 06:45:26,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:45:26,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [244222281] [2019-11-20 06:45:26,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_744ced4c-63e5-4dbd-b5e5-c113d1897e16/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:45:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:45:26,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 06:45:26,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:45:26,411 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-11-20 06:45:26,411 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:45:26,423 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:45:26,426 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-11-20 06:45:26,427 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:45:26,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:45:26,440 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:45:26,440 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 06:45:26,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 06:45:26,481 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-20 06:45:26,482 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:45:26,497 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:45:26,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 06:45:26,504 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 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 06:45:26,504 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:45:26,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:45:26,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 06:45:26,514 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-11-20 06:45:26,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:45:26,543 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:45:26,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:45:26,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:45:26,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [244222281] [2019-11-20 06:45:26,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:45:26,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-20 06:45:26,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806016058] [2019-11-20 06:45:26,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 06:45:26,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:45:26,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 06:45:26,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-20 06:45:26,881 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 8 states. [2019-11-20 06:45:31,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:45:31,005 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2019-11-20 06:45:31,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 06:45:31,007 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-20 06:45:31,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:45:31,008 INFO L225 Difference]: With dead ends: 115 [2019-11-20 06:45:31,008 INFO L226 Difference]: Without dead ends: 115 [2019-11-20 06:45:31,008 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-20 06:45:31,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-20 06:45:31,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 109. [2019-11-20 06:45:31,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-20 06:45:31,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2019-11-20 06:45:31,017 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 9 [2019-11-20 06:45:31,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:45:31,017 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2019-11-20 06:45:31,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 06:45:31,018 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2019-11-20 06:45:31,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 06:45:31,018 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:45:31,018 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:45:31,218 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:45:31,219 INFO L410 AbstractCegarLoop]: === Iteration 4 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 06:45:31,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:45:31,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1928042754, now seen corresponding path program 1 times [2019-11-20 06:45:31,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:45:31,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [772916166] [2019-11-20 06:45:31,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_744ced4c-63e5-4dbd-b5e5-c113d1897e16/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:45:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:45:31,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 06:45:31,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:45:31,379 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-11-20 06:45:31,379 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:45:31,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:45:31,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:45:31,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 06:45:31,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:45:31,392 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:45:31,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:45:31,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [772916166] [2019-11-20 06:45:31,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:45:31,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2019-11-20 06:45:31,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915769141] [2019-11-20 06:45:31,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:45:31,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:45:31,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:45:31,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:45:31,413 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 4 states. [2019-11-20 06:45:31,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:45:31,582 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2019-11-20 06:45:31,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:45:31,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-20 06:45:31,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:45:31,584 INFO L225 Difference]: With dead ends: 108 [2019-11-20 06:45:31,584 INFO L226 Difference]: Without dead ends: 108 [2019-11-20 06:45:31,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:45:31,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-20 06:45:31,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-11-20 06:45:31,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-20 06:45:31,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2019-11-20 06:45:31,593 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 10 [2019-11-20 06:45:31,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:45:31,593 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2019-11-20 06:45:31,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:45:31,593 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2019-11-20 06:45:31,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 06:45:31,593 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:45:31,594 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:45:31,795 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:45:31,796 INFO L410 AbstractCegarLoop]: === Iteration 5 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 06:45:31,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:45:31,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1928042753, now seen corresponding path program 1 times [2019-11-20 06:45:31,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:45:31,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1985174906] [2019-11-20 06:45:31,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_744ced4c-63e5-4dbd-b5e5-c113d1897e16/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:45:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:45:31,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 06:45:31,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:45:31,994 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-11-20 06:45:31,995 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:45:32,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:45:32,005 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:45:32,005 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 06:45:32,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:45:32,022 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:45:32,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:45:32,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1985174906] [2019-11-20 06:45:32,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:45:32,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 06:45:32,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452023119] [2019-11-20 06:45:32,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:45:32,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:45:32,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:45:32,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:45:32,054 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 4 states. [2019-11-20 06:45:32,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:45:32,413 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2019-11-20 06:45:32,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:45:32,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-20 06:45:32,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:45:32,415 INFO L225 Difference]: With dead ends: 107 [2019-11-20 06:45:32,415 INFO L226 Difference]: Without dead ends: 107 [2019-11-20 06:45:32,415 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:45:32,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-20 06:45:32,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-20 06:45:32,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-20 06:45:32,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2019-11-20 06:45:32,422 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 10 [2019-11-20 06:45:32,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:45:32,422 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2019-11-20 06:45:32,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:45:32,422 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2019-11-20 06:45:32,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 06:45:32,423 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:45:32,423 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:45:32,625 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:45:32,625 INFO L410 AbstractCegarLoop]: === Iteration 6 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 06:45:32,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:45:32,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1170863800, now seen corresponding path program 1 times [2019-11-20 06:45:32,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:45:32,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1070476645] [2019-11-20 06:45:32,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_744ced4c-63e5-4dbd-b5e5-c113d1897e16/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:45:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:45:32,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 06:45:32,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:45:32,810 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-11-20 06:45:32,810 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:45:32,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:45:32,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:45:32,813 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 06:45:32,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:45:32,817 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:45:32,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:45:32,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1070476645] [2019-11-20 06:45:32,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:45:32,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 06:45:32,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295703105] [2019-11-20 06:45:32,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:45:32,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:45:32,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:45:32,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:45:32,825 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 3 states. [2019-11-20 06:45:33,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:45:33,019 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2019-11-20 06:45:33,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:45:33,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-20 06:45:33,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:45:33,020 INFO L225 Difference]: With dead ends: 105 [2019-11-20 06:45:33,020 INFO L226 Difference]: Without dead ends: 105 [2019-11-20 06:45:33,020 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:45:33,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-20 06:45:33,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2019-11-20 06:45:33,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-20 06:45:33,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-11-20 06:45:33,025 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 15 [2019-11-20 06:45:33,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:45:33,025 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-11-20 06:45:33,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:45:33,025 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-11-20 06:45:33,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 06:45:33,026 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:45:33,026 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:45:33,229 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:45:33,229 INFO L410 AbstractCegarLoop]: === Iteration 7 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 06:45:33,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:45:33,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1170863801, now seen corresponding path program 1 times [2019-11-20 06:45:33,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:45:33,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [934018034] [2019-11-20 06:45:33,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_744ced4c-63e5-4dbd-b5e5-c113d1897e16/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:45:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:45:33,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 06:45:33,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:45:33,383 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-11-20 06:45:33,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:45:33,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:45:33,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:45:33,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 06:45:33,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:45:33,394 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:45:33,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:45:33,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [934018034] [2019-11-20 06:45:33,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:45:33,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 06:45:33,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703103214] [2019-11-20 06:45:33,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:45:33,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:45:33,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:45:33,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:45:33,436 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 4 states. [2019-11-20 06:45:33,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:45:33,735 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2019-11-20 06:45:33,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:45:33,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-20 06:45:33,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:45:33,737 INFO L225 Difference]: With dead ends: 106 [2019-11-20 06:45:33,737 INFO L226 Difference]: Without dead ends: 106 [2019-11-20 06:45:33,737 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:45:33,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-20 06:45:33,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2019-11-20 06:45:33,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-20 06:45:33,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2019-11-20 06:45:33,744 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 15 [2019-11-20 06:45:33,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:45:33,744 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2019-11-20 06:45:33,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:45:33,744 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2019-11-20 06:45:33,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 06:45:33,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:45:33,745 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:45:33,945 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:45:33,945 INFO L410 AbstractCegarLoop]: === Iteration 8 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 06:45:33,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:45:33,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1937021446, now seen corresponding path program 1 times [2019-11-20 06:45:33,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:45:33,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2061049064] [2019-11-20 06:45:33,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_744ced4c-63e5-4dbd-b5e5-c113d1897e16/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:45:34,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:45:34,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 06:45:34,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:45:34,107 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-11-20 06:45:34,107 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:45:34,109 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:45:34,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:45:34,110 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 06:45:34,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:45:34,123 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:45:34,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:45:34,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2061049064] [2019-11-20 06:45:34,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:45:34,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 5 [2019-11-20 06:45:34,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285042954] [2019-11-20 06:45:34,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 06:45:34,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:45:34,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 06:45:34,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 06:45:34,173 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 6 states. [2019-11-20 06:45:34,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:45:34,587 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2019-11-20 06:45:34,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 06:45:34,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-20 06:45:34,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:45:34,588 INFO L225 Difference]: With dead ends: 135 [2019-11-20 06:45:34,588 INFO L226 Difference]: Without dead ends: 135 [2019-11-20 06:45:34,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-20 06:45:34,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-20 06:45:34,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 100. [2019-11-20 06:45:34,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-20 06:45:34,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-11-20 06:45:34,593 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 16 [2019-11-20 06:45:34,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:45:34,594 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-11-20 06:45:34,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 06:45:34,594 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-11-20 06:45:34,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 06:45:34,594 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:45:34,595 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:45:34,795 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:45:34,796 INFO L410 AbstractCegarLoop]: === Iteration 9 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 06:45:34,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:45:34,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1937021447, now seen corresponding path program 1 times [2019-11-20 06:45:34,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:45:34,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1739724725] [2019-11-20 06:45:34,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_744ced4c-63e5-4dbd-b5e5-c113d1897e16/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:45:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:45:34,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 06:45:34,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:45:34,974 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-11-20 06:45:34,974 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:45:34,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:45:34,980 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:45:34,980 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 06:45:34,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:45:34,993 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:45:35,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:45:35,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:45:35,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1739724725] [2019-11-20 06:45:35,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:45:35,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-20 06:45:35,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023580931] [2019-11-20 06:45:35,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 06:45:35,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:45:35,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 06:45:35,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 06:45:35,071 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 6 states. [2019-11-20 06:45:35,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:45:35,618 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2019-11-20 06:45:35,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 06:45:35,619 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-20 06:45:35,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:45:35,620 INFO L225 Difference]: With dead ends: 109 [2019-11-20 06:45:35,620 INFO L226 Difference]: Without dead ends: 109 [2019-11-20 06:45:35,621 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 06:45:35,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-20 06:45:35,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2019-11-20 06:45:35,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-20 06:45:35,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-11-20 06:45:35,625 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 16 [2019-11-20 06:45:35,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:45:35,626 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-11-20 06:45:35,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 06:45:35,626 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-11-20 06:45:35,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 06:45:35,626 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:45:35,626 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:45:35,827 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:45:35,827 INFO L410 AbstractCegarLoop]: === Iteration 10 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 06:45:35,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:45:35,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1756774311, now seen corresponding path program 1 times [2019-11-20 06:45:35,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:45:35,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1267454989] [2019-11-20 06:45:35,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_744ced4c-63e5-4dbd-b5e5-c113d1897e16/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:45:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:45:35,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 06:45:35,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:45:36,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:45:36,009 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:45:36,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:45:36,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1267454989] [2019-11-20 06:45:36,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:45:36,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 06:45:36,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597468579] [2019-11-20 06:45:36,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 06:45:36,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:45:36,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 06:45:36,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 06:45:36,042 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 5 states. [2019-11-20 06:45:36,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:45:36,352 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2019-11-20 06:45:36,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 06:45:36,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-20 06:45:36,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:45:36,353 INFO L225 Difference]: With dead ends: 135 [2019-11-20 06:45:36,353 INFO L226 Difference]: Without dead ends: 135 [2019-11-20 06:45:36,354 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-20 06:45:36,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-20 06:45:36,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 102. [2019-11-20 06:45:36,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-20 06:45:36,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2019-11-20 06:45:36,358 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 18 [2019-11-20 06:45:36,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:45:36,358 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2019-11-20 06:45:36,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 06:45:36,358 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2019-11-20 06:45:36,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 06:45:36,359 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:45:36,359 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:45:36,561 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:45:36,561 INFO L410 AbstractCegarLoop]: === Iteration 11 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 06:45:36,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:45:36,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1756774312, now seen corresponding path program 1 times [2019-11-20 06:45:36,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:45:36,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1044974491] [2019-11-20 06:45:36,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_744ced4c-63e5-4dbd-b5e5-c113d1897e16/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:45:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:45:36,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 06:45:36,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:45:36,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:45:36,769 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:45:36,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:45:36,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:45:36,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1044974491] [2019-11-20 06:45:36,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:45:36,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 3] imperfect sequences [] total 8 [2019-11-20 06:45:36,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024294865] [2019-11-20 06:45:36,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 06:45:36,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:45:36,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 06:45:36,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-20 06:45:36,859 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 9 states. [2019-11-20 06:45:37,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:45:37,682 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2019-11-20 06:45:37,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 06:45:37,683 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-11-20 06:45:37,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:45:37,684 INFO L225 Difference]: With dead ends: 104 [2019-11-20 06:45:37,684 INFO L226 Difference]: Without dead ends: 104 [2019-11-20 06:45:37,684 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-20 06:45:37,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-20 06:45:37,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-20 06:45:37,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-20 06:45:37,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2019-11-20 06:45:37,687 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 18 [2019-11-20 06:45:37,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:45:37,687 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2019-11-20 06:45:37,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 06:45:37,687 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2019-11-20 06:45:37,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 06:45:37,688 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:45:37,688 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:45:37,888 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:45:37,893 INFO L410 AbstractCegarLoop]: === Iteration 12 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 06:45:37,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:45:37,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1749282988, now seen corresponding path program 1 times [2019-11-20 06:45:37,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:45:37,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [837519992] [2019-11-20 06:45:37,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_744ced4c-63e5-4dbd-b5e5-c113d1897e16/bin/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:45:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:45:38,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 06:45:38,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:45:38,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:45:38,065 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:45:38,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:45:38,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [837519992] [2019-11-20 06:45:38,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:45:38,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 06:45:38,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56711530] [2019-11-20 06:45:38,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:45:38,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:45:38,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:45:38,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:45:38,082 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 4 states. [2019-11-20 06:45:38,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:45:38,116 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2019-11-20 06:45:38,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:45:38,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-20 06:45:38,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:45:38,118 INFO L225 Difference]: With dead ends: 112 [2019-11-20 06:45:38,118 INFO L226 Difference]: Without dead ends: 112 [2019-11-20 06:45:38,119 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:45:38,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-20 06:45:38,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-11-20 06:45:38,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-20 06:45:38,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2019-11-20 06:45:38,123 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 18 [2019-11-20 06:45:38,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:45:38,123 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2019-11-20 06:45:38,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:45:38,123 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2019-11-20 06:45:38,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 06:45:38,124 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:45:38,124 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:45:38,326 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:45:38,326 INFO L410 AbstractCegarLoop]: === Iteration 13 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 06:45:38,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:45:38,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1606800861, now seen corresponding path program 1 times [2019-11-20 06:45:38,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:45:38,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1425261078] [2019-11-20 06:45:38,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_744ced4c-63e5-4dbd-b5e5-c113d1897e16/bin/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:45:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:45:38,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 06:45:38,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:45:38,508 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-11-20 06:45:38,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:45:38,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:45:38,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:45:38,513 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 06:45:38,531 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 06:45:38,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:45:38,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:45:38,550 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:45:38,550 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2019-11-20 06:45:38,576 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 23 treesize of output 11 [2019-11-20 06:45:38,577 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:45:38,581 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:45:38,582 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:45:38,582 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:7 [2019-11-20 06:45:38,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:45:38,593 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:45:38,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:45:38,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1425261078] [2019-11-20 06:45:38,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:45:38,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 06:45:38,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673037432] [2019-11-20 06:45:38,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 06:45:38,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:45:38,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 06:45:38,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 06:45:38,609 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand 5 states. [2019-11-20 06:45:38,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:45:38,944 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2019-11-20 06:45:38,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 06:45:38,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-20 06:45:38,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:45:38,945 INFO L225 Difference]: With dead ends: 114 [2019-11-20 06:45:38,945 INFO L226 Difference]: Without dead ends: 114 [2019-11-20 06:45:38,945 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 06:45:38,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-20 06:45:38,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2019-11-20 06:45:38,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-20 06:45:38,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2019-11-20 06:45:38,948 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 19 [2019-11-20 06:45:38,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:45:38,948 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2019-11-20 06:45:38,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 06:45:38,948 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2019-11-20 06:45:38,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 06:45:38,949 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:45:38,949 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:45:39,151 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:45:39,151 INFO L410 AbstractCegarLoop]: === Iteration 14 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 06:45:39,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:45:39,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1606800860, now seen corresponding path program 1 times [2019-11-20 06:45:39,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:45:39,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1379179127] [2019-11-20 06:45:39,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_744ced4c-63e5-4dbd-b5e5-c113d1897e16/bin/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:45:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:45:39,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 06:45:39,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:45:39,323 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-11-20 06:45:39,323 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:45:39,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:45:39,332 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:45:39,332 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 06:45:39,345 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 06:45:39,346 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:45:39,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:45:39,360 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 06:45:39,361 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:45:39,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:45:39,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:45:39,370 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2019-11-20 06:45:39,405 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 23 treesize of output 11 [2019-11-20 06:45:39,406 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:45:39,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:45:39,429 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 19 treesize of output 7 [2019-11-20 06:45:39,429 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:45:39,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:45:39,437 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:45:39,437 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:14 [2019-11-20 06:45:39,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:45:39,451 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:45:39,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:45:39,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1379179127] [2019-11-20 06:45:39,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:45:39,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 06:45:39,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053541313] [2019-11-20 06:45:39,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 06:45:39,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:45:39,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 06:45:39,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-20 06:45:39,756 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand 10 states. [2019-11-20 06:45:41,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:45:41,397 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2019-11-20 06:45:41,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 06:45:41,398 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-20 06:45:41,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:45:41,399 INFO L225 Difference]: With dead ends: 113 [2019-11-20 06:45:41,399 INFO L226 Difference]: Without dead ends: 113 [2019-11-20 06:45:41,400 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-11-20 06:45:41,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-20 06:45:41,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2019-11-20 06:45:41,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-20 06:45:41,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2019-11-20 06:45:41,404 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 19 [2019-11-20 06:45:41,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:45:41,404 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2019-11-20 06:45:41,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 06:45:41,404 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2019-11-20 06:45:41,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 06:45:41,405 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:45:41,405 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-11-20 06:45:41,608 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:45:41,608 INFO L410 AbstractCegarLoop]: === Iteration 15 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 06:45:41,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:45:41,609 INFO L82 PathProgramCache]: Analyzing trace with hash -195954174, now seen corresponding path program 1 times [2019-11-20 06:45:41,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:45:41,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [23828779] [2019-11-20 06:45:41,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_744ced4c-63e5-4dbd-b5e5-c113d1897e16/bin/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:45:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:45:41,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 06:45:41,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:45:41,800 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-11-20 06:45:41,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:45:41,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:45:41,818 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-11-20 06:45:41,819 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:45:41,830 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:45:41,830 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:45:41,830 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 06:45:41,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 06:45:41,875 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-20 06:45:41,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:45:41,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:45:41,892 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:45:41,892 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-11-20 06:45:41,893 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:45:41,901 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:45:41,901 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 06:45:41,902 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:20 [2019-11-20 06:45:41,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:45:41,920 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:45:41,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:45:42,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:45:42,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:45:42,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:45:42,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:45:42,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:45:42,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:45:42,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:45:42,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:45:45,574 WARN L191 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-11-20 06:45:45,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:45:47,867 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-11-20 06:45:48,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:45:48,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [23828779] [2019-11-20 06:45:48,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:45:48,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 06:45:48,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767057784] [2019-11-20 06:45:48,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 06:45:48,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:45:48,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 06:45:48,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=66, Unknown=1, NotChecked=0, Total=90 [2019-11-20 06:45:48,013 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 10 states. [2019-11-20 06:45:52,465 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|create_data_#t~malloc3.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= (store |c_old(#length)| |create_data_#t~malloc3.base| (_ bv8 32)) |c_#length|))) (= c_append_~node~0.offset (_ bv0 32)) (= (bvadd (select |c_#length| c_append_~node~0.base) (_ bv4294967288 32)) (_ bv0 32)) (forall ((v_append_~node~0.offset_BEFORE_CALL_4 (_ BitVec 32)) (|v_create_data_#t~malloc3.base_7| (_ BitVec 32)) (v_append_~node~0.base_BEFORE_CALL_6 (_ BitVec 32))) (let ((.cse0 (bvadd v_append_~node~0.offset_BEFORE_CALL_4 (_ bv4 32)))) (or (not (bvsle v_append_~node~0.offset_BEFORE_CALL_4 .cse0)) (exists ((|v_create_data_#t~malloc3.base_6| (_ BitVec 32))) (and (= (select |c_old(#valid)| |v_create_data_#t~malloc3.base_6|) (_ bv0 1)) (not (bvsle (bvadd v_append_~node~0.offset_BEFORE_CALL_4 (_ bv4 32)) (select (store |c_old(#length)| |v_create_data_#t~malloc3.base_6| (_ bv8 32)) v_append_~node~0.base_BEFORE_CALL_6))))) (bvsle .cse0 (select (store |c_#length| |v_create_data_#t~malloc3.base_7| (_ bv8 32)) v_append_~node~0.base_BEFORE_CALL_6)) (not (bvsle (_ bv0 32) v_append_~node~0.offset_BEFORE_CALL_4)) (not (= (_ bv0 1) (select |c_#valid| |v_create_data_#t~malloc3.base_7|)))))) (= (_ bv1 1) (select |c_#valid| c_append_~node~0.base))) is different from false [2019-11-20 06:46:06,825 WARN L191 SmtUtils]: Spent 6.10 s on a formula simplification that was a NOOP. DAG size: 41 [2019-11-20 06:46:20,002 WARN L191 SmtUtils]: Spent 2.58 s on a formula simplification that was a NOOP. DAG size: 42 [2019-11-20 06:46:43,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:43,504 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2019-11-20 06:46:43,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 06:46:43,505 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-20 06:46:43,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:43,506 INFO L225 Difference]: With dead ends: 129 [2019-11-20 06:46:43,506 INFO L226 Difference]: Without dead ends: 129 [2019-11-20 06:46:43,507 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 33.4s TimeCoverageRelationStatistics Valid=48, Invalid=128, Unknown=10, NotChecked=24, Total=210 [2019-11-20 06:46:43,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-20 06:46:43,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 114. [2019-11-20 06:46:43,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-20 06:46:43,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2019-11-20 06:46:43,512 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 20 [2019-11-20 06:46:43,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:43,512 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2019-11-20 06:46:43,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 06:46:43,513 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2019-11-20 06:46:43,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 06:46:43,513 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:43,514 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] [2019-11-20 06:46:43,717 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:46:43,717 INFO L410 AbstractCegarLoop]: === Iteration 16 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 06:46:43,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:43,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1628780014, now seen corresponding path program 1 times [2019-11-20 06:46:43,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:46:43,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1705302475] [2019-11-20 06:46:43,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_744ced4c-63e5-4dbd-b5e5-c113d1897e16/bin/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:46:43,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:43,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 06:46:43,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:46:43,873 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-20 06:46:43,874 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:46:43,875 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:46:43,875 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:46:43,875 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-11-20 06:46:43,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:43,885 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:46:43,921 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:46:43,921 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 12 treesize of output 16 [2019-11-20 06:46:43,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:46:43,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:46:43,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:46:43,923 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:46:43,924 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2019-11-20 06:46:43,930 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2019-11-20 06:46:43,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:46:43,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:46:43,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:46:43,932 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:3 [2019-11-20 06:46:43,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:43,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1705302475] [2019-11-20 06:46:43,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:43,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 06:46:43,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718705902] [2019-11-20 06:46:43,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 06:46:43,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:46:43,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 06:46:43,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 06:46:43,936 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 5 states. [2019-11-20 06:46:44,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:44,226 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2019-11-20 06:46:44,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 06:46:44,227 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-20 06:46:44,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:44,228 INFO L225 Difference]: With dead ends: 112 [2019-11-20 06:46:44,228 INFO L226 Difference]: Without dead ends: 112 [2019-11-20 06:46:44,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 06:46:44,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-20 06:46:44,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-11-20 06:46:44,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-20 06:46:44,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2019-11-20 06:46:44,232 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 22 [2019-11-20 06:46:44,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:44,232 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2019-11-20 06:46:44,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 06:46:44,233 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2019-11-20 06:46:44,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 06:46:44,233 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:44,233 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] [2019-11-20 06:46:44,434 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:46:44,434 INFO L410 AbstractCegarLoop]: === Iteration 17 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 06:46:44,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:44,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1628780013, now seen corresponding path program 1 times [2019-11-20 06:46:44,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:46:44,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1793360976] [2019-11-20 06:46:44,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_744ced4c-63e5-4dbd-b5e5-c113d1897e16/bin/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:46:44,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:44,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 06:46:44,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:46:44,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:44,644 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:46:44,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:46:44,766 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-11-20 06:46:44,766 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 06:46:44,778 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2019-11-20 06:46:44,778 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 06:46:44,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:46:44,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-20 06:46:44,815 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2019-11-20 06:46:44,937 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:46:44,937 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 16 treesize of output 20 [2019-11-20 06:46:44,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:46:44,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:46:44,938 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 06:46:44,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:46:44,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:46:44,968 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 06:46:44,968 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:30 [2019-11-20 06:46:44,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:46:45,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:46:45,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:46:45,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:46:45,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:46:45,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:46:45,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:46:45,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:45,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1793360976] [2019-11-20 06:46:45,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:45,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 06:46:45,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968412146] [2019-11-20 06:46:45,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 06:46:45,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:46:45,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 06:46:45,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-20 06:46:45,837 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 10 states. [2019-11-20 06:46:46,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:46,217 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2019-11-20 06:46:46,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 06:46:46,218 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-20 06:46:46,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:46,219 INFO L225 Difference]: With dead ends: 106 [2019-11-20 06:46:46,219 INFO L226 Difference]: Without dead ends: 106 [2019-11-20 06:46:46,219 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-20 06:46:46,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-20 06:46:46,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-11-20 06:46:46,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-20 06:46:46,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2019-11-20 06:46:46,223 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 22 [2019-11-20 06:46:46,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:46,223 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2019-11-20 06:46:46,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 06:46:46,223 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2019-11-20 06:46:46,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 06:46:46,224 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:46,224 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] [2019-11-20 06:46:46,427 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:46:46,427 INFO L410 AbstractCegarLoop]: === Iteration 18 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 06:46:46,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:46,427 INFO L82 PathProgramCache]: Analyzing trace with hash 666602723, now seen corresponding path program 1 times [2019-11-20 06:46:46,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:46:46,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [304458735] [2019-11-20 06:46:46,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_744ced4c-63e5-4dbd-b5e5-c113d1897e16/bin/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:46:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:46,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-20 06:46:46,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:46:46,623 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-11-20 06:46:46,623 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:46:46,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:46:46,636 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-11-20 06:46:46,636 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:46:46,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:46:46,643 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:46:46,643 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 06:46:46,688 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:46:46,688 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 13 treesize of output 17 [2019-11-20 06:46:46,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:46:46,700 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:46:46,703 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-20 06:46:46,703 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:46:46,717 INFO L567 ElimStorePlain]: treesize reduction 4, result has 80.0 percent of original size [2019-11-20 06:46:46,717 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 06:46:46,717 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-11-20 06:46:46,841 INFO L392 ElimStorePlain]: Different costs {1=[|v_old(#valid)_AFTER_CALL_64|], 3=[|v_old(#length)_AFTER_CALL_46|]} [2019-11-20 06:46:46,854 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:46:46,855 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-11-20 06:46:46,855 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:46:46,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:46:46,893 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:46:46,893 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 46 [2019-11-20 06:46:46,894 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:46:46,920 INFO L567 ElimStorePlain]: treesize reduction 22, result has 48.8 percent of original size [2019-11-20 06:46:46,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 06:46:46,921 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:21 [2019-11-20 06:46:46,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:46,933 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:46:47,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:46:47,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:46:47,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:46:47,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:46:47,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:46:47,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:46:47,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:46:47,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:46:48,005 WARN L191 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-11-20 06:46:48,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:46:48,400 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-11-20 06:46:48,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:46:48,544 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:46:48,544 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 13 treesize of output 17 [2019-11-20 06:46:48,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:46:48,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:46:48,561 INFO L496 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-11-20 06:46:48,561 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 [2019-11-20 06:46:48,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:48,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [304458735] [2019-11-20 06:46:48,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:48,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 8] imperfect sequences [] total 14 [2019-11-20 06:46:48,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964559209] [2019-11-20 06:46:48,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-20 06:46:48,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:46:48,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 06:46:48,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-11-20 06:46:48,859 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand 15 states. [2019-11-20 06:46:53,088 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|create_data_#t~malloc3.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= (store |c_old(#length)| |create_data_#t~malloc3.base| (_ bv8 32)) |c_#length|))) (forall ((|v_create_data_#t~malloc3.base_11| (_ BitVec 32)) (v_append_~pointerToList.base_BEFORE_CALL_10 (_ BitVec 32)) (v_append_~pointerToList.offset_BEFORE_CALL_6 (_ BitVec 32))) (let ((.cse0 (bvadd v_append_~pointerToList.offset_BEFORE_CALL_6 (_ bv4 32)))) (or (not (bvsle v_append_~pointerToList.offset_BEFORE_CALL_6 .cse0)) (not (bvsle (_ bv0 32) v_append_~pointerToList.offset_BEFORE_CALL_6)) (bvsle .cse0 (select (store |c_#length| |v_create_data_#t~malloc3.base_11| (_ bv8 32)) v_append_~pointerToList.base_BEFORE_CALL_10)) (not (= (select |c_#valid| |v_create_data_#t~malloc3.base_11|) (_ bv0 1))) (exists ((v_prenex_12 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_prenex_12)) (not (bvsle (bvadd v_append_~pointerToList.offset_BEFORE_CALL_6 (_ bv4 32)) (select (store |c_old(#length)| v_prenex_12 (_ bv8 32)) v_append_~pointerToList.base_BEFORE_CALL_10)))))))) (= (bvadd (select |c_#length| c_append_~pointerToList.base) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv0 32) c_append_~pointerToList.offset) (exists ((|append_#t~malloc12.base| (_ BitVec 32))) (= (bvadd (select |c_#length| |append_#t~malloc12.base|) (_ bv4294967288 32)) (_ bv0 32))) (= (bvadd (select |c_#valid| |c_append_#in~pointerToList.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv4 32) (select |c_#length| |c_append_#in~pointerToList.base|)) (= (_ bv0 32) |c_append_#in~pointerToList.offset|) (= (_ bv1 1) (select |c_#valid| c_append_~pointerToList.base))) is different from false [2019-11-20 06:47:23,595 WARN L191 SmtUtils]: Spent 6.08 s on a formula simplification that was a NOOP. DAG size: 41 [2019-11-20 06:48:33,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:48:33,563 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2019-11-20 06:48:33,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 06:48:33,563 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-11-20 06:48:33,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:48:33,564 INFO L225 Difference]: With dead ends: 130 [2019-11-20 06:48:33,565 INFO L226 Difference]: Without dead ends: 130 [2019-11-20 06:48:33,565 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 32.4s TimeCoverageRelationStatistics Valid=59, Invalid=239, Unknown=12, NotChecked=32, Total=342 [2019-11-20 06:48:33,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-20 06:48:33,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 115. [2019-11-20 06:48:33,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-20 06:48:33,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2019-11-20 06:48:33,570 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 22 [2019-11-20 06:48:33,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:48:33,570 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2019-11-20 06:48:33,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-20 06:48:33,570 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2019-11-20 06:48:33,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 06:48:33,571 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:48:33,571 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:48:33,773 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:48:33,773 INFO L410 AbstractCegarLoop]: === Iteration 19 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 06:48:33,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:48:33,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1889374095, now seen corresponding path program 1 times [2019-11-20 06:48:33,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:48:33,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1160770926] [2019-11-20 06:48:33,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_744ced4c-63e5-4dbd-b5e5-c113d1897e16/bin/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:48:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:48:33,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-20 06:48:33,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:48:33,956 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-11-20 06:48:33,956 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:48:33,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:48:33,964 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-11-20 06:48:33,964 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:48:33,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:48:33,970 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:48:33,970 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 06:48:34,059 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:48:34,060 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-11-20 06:48:34,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:48:34,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:48:34,074 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-20 06:48:34,074 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:48:34,092 INFO L567 ElimStorePlain]: treesize reduction 4, result has 84.0 percent of original size [2019-11-20 06:48:34,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 06:48:34,093 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2019-11-20 06:48:34,138 INFO L392 ElimStorePlain]: Different costs {1=[|v_#valid_199|], 3=[|v_#length_122|]} [2019-11-20 06:48:34,147 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:48:34,147 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 13 treesize of output 17 [2019-11-20 06:48:34,147 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:48:34,160 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:48:34,180 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:48:34,181 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 46 [2019-11-20 06:48:34,181 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:48:34,209 INFO L567 ElimStorePlain]: treesize reduction 28, result has 42.9 percent of original size [2019-11-20 06:48:34,210 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 06:48:34,210 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:21 [2019-11-20 06:48:34,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:48:34,244 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:48:34,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:48:34,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:48:34,667 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:48:34,668 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 24 treesize of output 28 [2019-11-20 06:48:34,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:48:34,689 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:48:34,690 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 32 treesize of output 36 [2019-11-20 06:48:34,690 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:48:34,700 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:48:34,700 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 22 treesize of output 26 [2019-11-20 06:48:34,700 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 06:48:34,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:48:34,740 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-20 06:48:34,740 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:79, output treesize:46 [2019-11-20 06:48:34,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:48:34,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:48:34,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:48:34,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:48:34,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:48:34,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:48:34,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:48:34,849 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-20 06:48:34,857 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2019-11-20 06:48:36,094 WARN L191 SmtUtils]: Spent 905.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2019-11-20 06:48:36,097 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-20 06:48:36,101 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-20 06:48:36,105 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-20 06:48:36,109 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-20 06:48:36,142 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-11-20 06:48:36,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:48:36,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:48:36,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:48:36,302 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 13 [2019-11-20 06:48:36,311 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-20 06:48:36,316 INFO L392 ElimStorePlain]: Different costs {2=[|v_old(#length)_BEFORE_CALL_2|], 6=[|v_old(#valid)_BEFORE_CALL_2|]} [2019-11-20 06:48:36,516 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:48:36,517 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 06:48:36,521 INFO L168 Benchmark]: Toolchain (without parser) took 193692.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 939.3 MB in the beginning and 940.1 MB in the end (delta: -766.6 kB). Peak memory consumption was 171.7 MB. Max. memory is 11.5 GB. [2019-11-20 06:48:36,522 INFO L168 Benchmark]: CDTParser took 0.67 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 06:48:36,522 INFO L168 Benchmark]: CACSL2BoogieTranslator took 652.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -170.0 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-20 06:48:36,522 INFO L168 Benchmark]: Boogie Preprocessor took 65.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-20 06:48:36,523 INFO L168 Benchmark]: RCFGBuilder took 869.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.4 MB). Peak memory consumption was 65.4 MB. Max. memory is 11.5 GB. [2019-11-20 06:48:36,523 INFO L168 Benchmark]: TraceAbstraction took 192102.43 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 45.6 MB). Free memory was 1.0 GB in the beginning and 940.1 MB in the end (delta: 97.2 MB). Peak memory consumption was 142.8 MB. Max. memory is 11.5 GB. [2019-11-20 06:48:36,525 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.67 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 652.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -170.0 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 869.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.4 MB). Peak memory consumption was 65.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 192102.43 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 45.6 MB). Free memory was 1.0 GB in the beginning and 940.1 MB in the end (delta: 97.2 MB). Peak memory consumption was 142.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...