./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b5699aa 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_2871c15d-dcc6-4a2f-b890-734ce5e97cdf/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2871c15d-dcc6-4a2f-b890-734ce5e97cdf/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2871c15d-dcc6-4a2f-b890-734ce5e97cdf/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2871c15d-dcc6-4a2f-b890-734ce5e97cdf/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_2871c15d-dcc6-4a2f-b890-734ce5e97cdf/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2871c15d-dcc6-4a2f-b890-734ce5e97cdf/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 0db1674e58e1126b93b48759a00b2e69f0d5f058 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-6b5699a [2019-11-25 08:54:36,633 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:54:36,635 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:54:36,646 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:54:36,646 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:54:36,647 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:54:36,648 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:54:36,650 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:54:36,652 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:54:36,653 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:54:36,654 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:54:36,655 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:54:36,656 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:54:36,657 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:54:36,657 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:54:36,659 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:54:36,659 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:54:36,660 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:54:36,662 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:54:36,664 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:54:36,665 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:54:36,666 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:54:36,667 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:54:36,668 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:54:36,670 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:54:36,670 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:54:36,671 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:54:36,671 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:54:36,672 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:54:36,673 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:54:36,673 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:54:36,673 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:54:36,674 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:54:36,675 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:54:36,675 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:54:36,676 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:54:36,676 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:54:36,676 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:54:36,677 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:54:36,677 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:54:36,678 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:54:36,679 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2871c15d-dcc6-4a2f-b890-734ce5e97cdf/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-25 08:54:36,691 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:54:36,691 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:54:36,692 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:54:36,692 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:54:36,692 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:54:36,693 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:54:36,693 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:54:36,693 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 08:54:36,693 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:54:36,694 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:54:36,694 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:54:36,694 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 08:54:36,694 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 08:54:36,694 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 08:54:36,695 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:54:36,695 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 08:54:36,695 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-25 08:54:36,695 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-25 08:54:36,695 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:54:36,696 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:54:36,696 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:54:36,696 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:54:36,696 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:54:36,697 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:54:36,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:54:36,697 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:54:36,697 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:54:36,698 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-25 08:54:36,698 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-25 08:54:36,698 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-25 08:54:36,698 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_2871c15d-dcc6-4a2f-b890-734ce5e97cdf/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 -> 0db1674e58e1126b93b48759a00b2e69f0d5f058 [2019-11-25 08:54:36,868 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:54:36,880 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:54:36,883 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:54:36,884 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:54:36,884 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:54:36,885 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2871c15d-dcc6-4a2f-b890-734ce5e97cdf/bin/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2019-11-25 08:54:36,937 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2871c15d-dcc6-4a2f-b890-734ce5e97cdf/bin/uautomizer/data/d0d7e7cbe/676f0eea08004e49b0bc6c8818761ae1/FLAG633fd37c5 [2019-11-25 08:54:37,440 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:54:37,440 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2871c15d-dcc6-4a2f-b890-734ce5e97cdf/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2019-11-25 08:54:37,457 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2871c15d-dcc6-4a2f-b890-734ce5e97cdf/bin/uautomizer/data/d0d7e7cbe/676f0eea08004e49b0bc6c8818761ae1/FLAG633fd37c5 [2019-11-25 08:54:37,910 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2871c15d-dcc6-4a2f-b890-734ce5e97cdf/bin/uautomizer/data/d0d7e7cbe/676f0eea08004e49b0bc6c8818761ae1 [2019-11-25 08:54:37,913 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:54:37,915 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 08:54:37,915 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:54:37,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:54:37,920 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:54:37,921 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:54:37" (1/1) ... [2019-11-25 08:54:37,923 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10d7a8c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:37, skipping insertion in model container [2019-11-25 08:54:37,923 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:54:37" (1/1) ... [2019-11-25 08:54:37,930 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:54:37,971 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:54:38,304 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:54:38,312 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:54:38,354 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:54:38,407 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:54:38,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:38 WrapperNode [2019-11-25 08:54:38,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:54:38,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:54:38,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:54:38,409 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:54:38,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:38" (1/1) ... [2019-11-25 08:54:38,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:38" (1/1) ... [2019-11-25 08:54:38,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:38" (1/1) ... [2019-11-25 08:54:38,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:38" (1/1) ... [2019-11-25 08:54:38,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:38" (1/1) ... [2019-11-25 08:54:38,463 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:38" (1/1) ... [2019-11-25 08:54:38,467 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:38" (1/1) ... [2019-11-25 08:54:38,474 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:54:38,475 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:54:38,475 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:54:38,475 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:54:38,476 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2871c15d-dcc6-4a2f-b890-734ce5e97cdf/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-25 08:54:38,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-25 08:54:38,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:54:38,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 08:54:38,537 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-25 08:54:38,538 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-25 08:54:38,538 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-25 08:54:38,538 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-25 08:54:38,538 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-25 08:54:38,538 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-11-25 08:54:38,538 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-25 08:54:38,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-25 08:54:38,539 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-25 08:54:38,539 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-25 08:54:38,539 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-25 08:54:38,539 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-25 08:54:38,539 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-25 08:54:38,539 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-25 08:54:38,540 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-25 08:54:38,540 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-25 08:54:38,540 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-25 08:54:38,540 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-25 08:54:38,540 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-25 08:54:38,540 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-25 08:54:38,541 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-25 08:54:38,541 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-25 08:54:38,541 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-25 08:54:38,541 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-25 08:54:38,541 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-25 08:54:38,541 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-25 08:54:38,541 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-25 08:54:38,541 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-25 08:54:38,542 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-25 08:54:38,542 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-25 08:54:38,542 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-25 08:54:38,542 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-25 08:54:38,542 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-25 08:54:38,542 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-25 08:54:38,542 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-25 08:54:38,542 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-25 08:54:38,543 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-25 08:54:38,543 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-25 08:54:38,543 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-25 08:54:38,543 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-25 08:54:38,543 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-25 08:54:38,543 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-25 08:54:38,543 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-25 08:54:38,543 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-25 08:54:38,544 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-25 08:54:38,544 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-25 08:54:38,544 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-25 08:54:38,544 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-25 08:54:38,544 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-25 08:54:38,544 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-25 08:54:38,544 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-25 08:54:38,545 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-25 08:54:38,545 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-25 08:54:38,545 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-25 08:54:38,545 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-25 08:54:38,545 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-25 08:54:38,545 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-25 08:54:38,545 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-25 08:54:38,545 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-25 08:54:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-25 08:54:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-25 08:54:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-25 08:54:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-25 08:54:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-25 08:54:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-25 08:54:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-25 08:54:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-25 08:54:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-25 08:54:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-25 08:54:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-25 08:54:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-25 08:54:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-25 08:54:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-25 08:54:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-25 08:54:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-25 08:54:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-25 08:54:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-25 08:54:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-25 08:54:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-25 08:54:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-25 08:54:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-25 08:54:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-25 08:54:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-25 08:54:38,549 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-25 08:54:38,549 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-25 08:54:38,549 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-25 08:54:38,549 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-25 08:54:38,549 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-25 08:54:38,549 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-25 08:54:38,549 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-25 08:54:38,549 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-25 08:54:38,549 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-25 08:54:38,550 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-25 08:54:38,550 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-25 08:54:38,550 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-25 08:54:38,550 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-25 08:54:38,550 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-25 08:54:38,550 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-25 08:54:38,550 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-25 08:54:38,550 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-25 08:54:38,551 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-25 08:54:38,551 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-25 08:54:38,551 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-25 08:54:38,551 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-25 08:54:38,551 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-25 08:54:38,551 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-25 08:54:38,551 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-25 08:54:38,551 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-25 08:54:38,552 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-25 08:54:38,552 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-25 08:54:38,552 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-25 08:54:38,552 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-25 08:54:38,552 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-25 08:54:38,552 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-25 08:54:38,552 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-25 08:54:38,552 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-25 08:54:38,553 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-11-25 08:54:38,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 08:54:38,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 08:54:38,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 08:54:38,553 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-25 08:54:38,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:54:38,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-25 08:54:38,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:54:38,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-25 08:54:38,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:54:38,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 08:54:39,478 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:54:39,478 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-25 08:54:39,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:54:39 BoogieIcfgContainer [2019-11-25 08:54:39,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:54:39,480 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:54:39,480 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:54:39,483 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:54:39,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:54:37" (1/3) ... [2019-11-25 08:54:39,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33dc8c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:54:39, skipping insertion in model container [2019-11-25 08:54:39,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:38" (2/3) ... [2019-11-25 08:54:39,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33dc8c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:54:39, skipping insertion in model container [2019-11-25 08:54:39,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:54:39" (3/3) ... [2019-11-25 08:54:39,486 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0232_1-1.i [2019-11-25 08:54:39,494 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:54:39,500 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 44 error locations. [2019-11-25 08:54:39,510 INFO L249 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2019-11-25 08:54:39,527 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:54:39,527 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-25 08:54:39,527 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:54:39,528 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:54:39,528 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:54:39,528 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:54:39,528 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:54:39,528 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:54:39,546 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2019-11-25 08:54:39,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-25 08:54:39,554 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:39,554 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:39,555 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-25 08:54:39,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:39,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1838750763, now seen corresponding path program 1 times [2019-11-25 08:54:39,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:54:39,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [831075290] [2019-11-25 08:54:39,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2871c15d-dcc6-4a2f-b890-734ce5e97cdf/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-25 08:54:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:39,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 08:54:39,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:39,853 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-25 08:54:39,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:39,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:39,872 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:54:39,873 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 08:54:39,926 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:39,926 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-25 08:54:39,927 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:39,951 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-25 08:54:39,952 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-25 08:54:39,952 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-11-25 08:54:39,971 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-25 08:54:39,971 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:54:40,005 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-25 08:54:40,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [831075290] [2019-11-25 08:54:40,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:40,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-25 08:54:40,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537093326] [2019-11-25 08:54:40,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:54:40,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:54:40,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:54:40,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:54:40,030 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 5 states. [2019-11-25 08:54:40,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:40,380 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2019-11-25 08:54:40,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:54:40,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-25 08:54:40,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:40,394 INFO L225 Difference]: With dead ends: 94 [2019-11-25 08:54:40,394 INFO L226 Difference]: Without dead ends: 91 [2019-11-25 08:54:40,397 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-25 08:54:40,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-25 08:54:40,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-11-25 08:54:40,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-25 08:54:40,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2019-11-25 08:54:40,461 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 9 [2019-11-25 08:54:40,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:40,461 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2019-11-25 08:54:40,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:54:40,461 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2019-11-25 08:54:40,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-25 08:54:40,462 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:40,462 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:40,668 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:54:40,668 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-25 08:54:40,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:40,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1838750764, now seen corresponding path program 1 times [2019-11-25 08:54:40,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:54:40,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1316703186] [2019-11-25 08:54:40,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2871c15d-dcc6-4a2f-b890-734ce5e97cdf/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-25 08:54:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:40,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-25 08:54:40,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:40,882 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-25 08:54:40,883 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:40,899 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:40,903 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-25 08:54:40,903 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:40,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:40,912 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:54:40,913 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-25 08:54:40,979 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:40,979 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-25 08:54:40,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:40,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:41,002 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-25 08:54:41,003 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:41,027 INFO L567 ElimStorePlain]: treesize reduction 4, result has 77.8 percent of original size [2019-11-25 08:54:41,028 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-25 08:54:41,028 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2019-11-25 08:54:41,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-25 08:54:41,052 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:54:41,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:54:41,363 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-25 08:54:41,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1316703186] [2019-11-25 08:54:41,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:41,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-25 08:54:41,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040400098] [2019-11-25 08:54:41,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:54:41,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:54:41,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:54:41,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:54:41,366 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand 8 states. [2019-11-25 08:54:44,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:44,422 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2019-11-25 08:54:44,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:54:44,424 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-25 08:54:44,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:44,428 INFO L225 Difference]: With dead ends: 125 [2019-11-25 08:54:44,428 INFO L226 Difference]: Without dead ends: 125 [2019-11-25 08:54:44,429 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:54:44,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-25 08:54:44,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 95. [2019-11-25 08:54:44,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-25 08:54:44,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2019-11-25 08:54:44,440 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 9 [2019-11-25 08:54:44,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:44,440 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2019-11-25 08:54:44,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:54:44,440 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2019-11-25 08:54:44,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-25 08:54:44,441 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:44,441 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:44,643 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:54:44,644 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-25 08:54:44,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:44,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1166698909, now seen corresponding path program 1 times [2019-11-25 08:54:44,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:54:44,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2147767] [2019-11-25 08:54:44,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2871c15d-dcc6-4a2f-b890-734ce5e97cdf/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-25 08:54:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:44,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:54:44,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:44,855 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-25 08:54:44,855 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:44,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:44,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:54:44,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 08:54:44,867 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-25 08:54:44,868 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:54:44,890 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-25 08:54:44,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2147767] [2019-11-25 08:54:44,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:44,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2019-11-25 08:54:44,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780385784] [2019-11-25 08:54:44,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:54:44,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:54:44,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:54:44,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:54:44,892 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand 4 states. [2019-11-25 08:54:45,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:45,075 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2019-11-25 08:54:45,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:45,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-25 08:54:45,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:45,077 INFO L225 Difference]: With dead ends: 91 [2019-11-25 08:54:45,077 INFO L226 Difference]: Without dead ends: 91 [2019-11-25 08:54:45,077 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-25 08:54:45,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-25 08:54:45,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-11-25 08:54:45,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-25 08:54:45,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2019-11-25 08:54:45,101 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 10 [2019-11-25 08:54:45,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:45,101 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2019-11-25 08:54:45,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:54:45,102 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2019-11-25 08:54:45,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-25 08:54:45,102 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:45,103 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:45,314 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:54:45,315 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-25 08:54:45,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:45,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1166698910, now seen corresponding path program 1 times [2019-11-25 08:54:45,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:54:45,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [726675024] [2019-11-25 08:54:45,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2871c15d-dcc6-4a2f-b890-734ce5e97cdf/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-25 08:54:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:45,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 08:54:45,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:45,527 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-25 08:54:45,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:45,533 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:45,533 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:54:45,534 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 08:54:45,540 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-25 08:54:45,540 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:54:45,580 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-25 08:54:45,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [726675024] [2019-11-25 08:54:45,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:45,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-25 08:54:45,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546436241] [2019-11-25 08:54:45,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:54:45,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:54:45,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:54:45,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:54:45,582 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 4 states. [2019-11-25 08:54:45,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:45,739 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2019-11-25 08:54:45,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:45,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-25 08:54:45,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:45,740 INFO L225 Difference]: With dead ends: 87 [2019-11-25 08:54:45,741 INFO L226 Difference]: Without dead ends: 87 [2019-11-25 08:54:45,741 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-25 08:54:45,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-25 08:54:45,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-11-25 08:54:45,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-25 08:54:45,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2019-11-25 08:54:45,748 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 10 [2019-11-25 08:54:45,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:45,748 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2019-11-25 08:54:45,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:54:45,748 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2019-11-25 08:54:45,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-25 08:54:45,749 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:45,749 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:45,951 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:54:45,952 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-25 08:54:45,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:45,952 INFO L82 PathProgramCache]: Analyzing trace with hash -544296458, now seen corresponding path program 1 times [2019-11-25 08:54:45,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:54:45,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1647522933] [2019-11-25 08:54:45,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2871c15d-dcc6-4a2f-b890-734ce5e97cdf/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-25 08:54:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:46,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-25 08:54:46,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:46,223 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-11-25 08:54:46,224 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2019-11-25 08:54:46,224 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:46,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:46,255 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-11-25 08:54:46,255 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2019-11-25 08:54:46,256 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:46,265 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:46,266 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:54:46,266 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-11-25 08:54:46,317 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:46,318 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 26 treesize of output 22 [2019-11-25 08:54:46,318 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:46,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:46,336 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:46,336 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 [2019-11-25 08:54:46,337 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:46,346 INFO L567 ElimStorePlain]: treesize reduction 12, result has 36.8 percent of original size [2019-11-25 08:54:46,347 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:54:46,347 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:47, output treesize:7 [2019-11-25 08:54:46,373 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-25 08:54:46,373 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:54:46,536 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-25 08:54:46,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1647522933] [2019-11-25 08:54:46,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:46,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-11-25 08:54:46,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534827965] [2019-11-25 08:54:46,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-25 08:54:46,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:54:46,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-25 08:54:46,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-25 08:54:46,538 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand 13 states. [2019-11-25 08:54:47,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:47,345 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2019-11-25 08:54:47,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 08:54:47,346 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-11-25 08:54:47,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:47,348 INFO L225 Difference]: With dead ends: 99 [2019-11-25 08:54:47,348 INFO L226 Difference]: Without dead ends: 99 [2019-11-25 08:54:47,348 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2019-11-25 08:54:47,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-25 08:54:47,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2019-11-25 08:54:47,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-25 08:54:47,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2019-11-25 08:54:47,359 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 15 [2019-11-25 08:54:47,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:47,360 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2019-11-25 08:54:47,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-25 08:54:47,360 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2019-11-25 08:54:47,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-25 08:54:47,362 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:47,362 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:47,565 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:54:47,566 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-25 08:54:47,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:47,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1237872333, now seen corresponding path program 1 times [2019-11-25 08:54:47,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:54:47,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [875930380] [2019-11-25 08:54:47,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2871c15d-dcc6-4a2f-b890-734ce5e97cdf/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-25 08:54:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:47,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:54:47,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:47,757 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-25 08:54:47,757 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:54:47,773 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-25 08:54:47,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [875930380] [2019-11-25 08:54:47,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:47,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-25 08:54:47,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785264390] [2019-11-25 08:54:47,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:47,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:54:47,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:47,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:47,775 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 3 states. [2019-11-25 08:54:47,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:47,790 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2019-11-25 08:54:47,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:47,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-25 08:54:47,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:47,791 INFO L225 Difference]: With dead ends: 103 [2019-11-25 08:54:47,792 INFO L226 Difference]: Without dead ends: 103 [2019-11-25 08:54:47,792 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-25 08:54:47,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-25 08:54:47,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 90. [2019-11-25 08:54:47,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-25 08:54:47,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2019-11-25 08:54:47,798 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 24 [2019-11-25 08:54:47,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:47,799 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2019-11-25 08:54:47,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:47,800 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2019-11-25 08:54:47,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-25 08:54:47,801 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:47,801 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:48,007 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:54:48,007 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-25 08:54:48,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:48,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1237873521, now seen corresponding path program 1 times [2019-11-25 08:54:48,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:54:48,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [918623307] [2019-11-25 08:54:48,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2871c15d-dcc6-4a2f-b890-734ce5e97cdf/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-25 08:54:48,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:48,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:54:48,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:48,215 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-25 08:54:48,215 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:54:48,245 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-25 08:54:48,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [918623307] [2019-11-25 08:54:48,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:48,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-25 08:54:48,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618513031] [2019-11-25 08:54:48,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:54:48,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:54:48,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:54:48,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:54:48,247 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand 6 states. [2019-11-25 08:54:48,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:48,333 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2019-11-25 08:54:48,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:54:48,333 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-25 08:54:48,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:48,335 INFO L225 Difference]: With dead ends: 124 [2019-11-25 08:54:48,335 INFO L226 Difference]: Without dead ends: 124 [2019-11-25 08:54:48,335 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:54:48,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-25 08:54:48,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 93. [2019-11-25 08:54:48,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-25 08:54:48,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 109 transitions. [2019-11-25 08:54:48,341 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 109 transitions. Word has length 24 [2019-11-25 08:54:48,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:48,342 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 109 transitions. [2019-11-25 08:54:48,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:54:48,342 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2019-11-25 08:54:48,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-25 08:54:48,343 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:48,343 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:48,551 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:54:48,551 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-25 08:54:48,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:48,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1239095717, now seen corresponding path program 1 times [2019-11-25 08:54:48,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:54:48,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1318721946] [2019-11-25 08:54:48,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2871c15d-dcc6-4a2f-b890-734ce5e97cdf/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-25 08:54:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:48,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 08:54:48,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:48,749 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-25 08:54:48,749 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:48,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:48,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:54:48,756 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-11-25 08:54:48,788 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 11 treesize of output 7 [2019-11-25 08:54:48,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:48,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:48,799 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-25 08:54:48,799 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-11-25 08:54:48,835 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 17 treesize of output 9 [2019-11-25 08:54:48,836 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:48,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:48,838 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-25 08:54:48,838 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:7 [2019-11-25 08:54:48,852 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-25 08:54:48,852 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:54:48,982 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 32 treesize of output 28 [2019-11-25 08:54:48,983 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-25 08:54:49,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:49,004 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:54:49,005 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:28 [2019-11-25 08:54:49,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:54:49,077 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 10 treesize of output 8 [2019-11-25 08:54:49,077 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:49,080 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 10 treesize of output 8 [2019-11-25 08:54:49,080 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:49,085 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:49,085 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-25 08:54:49,085 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 [2019-11-25 08:54:49,090 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-25 08:54:49,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1318721946] [2019-11-25 08:54:49,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:49,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 9 [2019-11-25 08:54:49,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857630136] [2019-11-25 08:54:49,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 08:54:49,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:54:49,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:54:49,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:54:49,091 INFO L87 Difference]: Start difference. First operand 93 states and 109 transitions. Second operand 10 states. [2019-11-25 08:54:49,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:49,408 INFO L93 Difference]: Finished difference Result 94 states and 109 transitions. [2019-11-25 08:54:49,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:54:49,409 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-11-25 08:54:49,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:49,410 INFO L225 Difference]: With dead ends: 94 [2019-11-25 08:54:49,410 INFO L226 Difference]: Without dead ends: 94 [2019-11-25 08:54:49,411 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:54:49,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-25 08:54:49,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2019-11-25 08:54:49,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-25 08:54:49,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 107 transitions. [2019-11-25 08:54:49,417 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 107 transitions. Word has length 24 [2019-11-25 08:54:49,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:49,417 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 107 transitions. [2019-11-25 08:54:49,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 08:54:49,417 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2019-11-25 08:54:49,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-25 08:54:49,418 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:49,418 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:49,622 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:54:49,622 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-25 08:54:49,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:49,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1239095716, now seen corresponding path program 1 times [2019-11-25 08:54:49,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:54:49,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [581082764] [2019-11-25 08:54:49,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2871c15d-dcc6-4a2f-b890-734ce5e97cdf/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-25 08:54:49,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:49,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-25 08:54:49,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:49,895 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 11 treesize of output 7 [2019-11-25 08:54:49,895 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:49,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:49,925 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 11 treesize of output 7 [2019-11-25 08:54:49,926 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:49,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:49,938 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-25 08:54:49,938 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2019-11-25 08:54:49,999 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 17 treesize of output 9 [2019-11-25 08:54:49,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:50,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:50,020 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-25 08:54:50,021 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:50,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:50,030 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-25 08:54:50,031 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2019-11-25 08:54:50,061 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-25 08:54:50,061 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:54:50,426 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 28 treesize of output 24 [2019-11-25 08:54:50,427 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-25 08:54:50,452 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:50,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:54:50,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:54:50,456 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:50,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:50,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:54:50,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:54:50,483 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:50,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:50,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:54:50,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:54:50,509 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:50,528 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:50,529 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 5 xjuncts. [2019-11-25 08:54:50,529 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:76, output treesize:22 [2019-11-25 08:54:50,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:54:50,605 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 16 treesize of output 12 [2019-11-25 08:54:50,606 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-25 08:54:50,623 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-25 08:54:50,623 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-25 08:54:50,632 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-25 08:54:50,633 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:54:50,641 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-25 08:54:50,642 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:54:50,654 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-25 08:54:50,655 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:54:50,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:50,724 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 5 xjuncts. [2019-11-25 08:54:50,724 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:67, output treesize:55 [2019-11-25 08:54:50,913 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 21 [2019-11-25 08:54:50,937 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-25 08:54:50,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [581082764] [2019-11-25 08:54:50,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:50,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 12 [2019-11-25 08:54:50,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290475645] [2019-11-25 08:54:50,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-25 08:54:50,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:54:50,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-25 08:54:50,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-25 08:54:50,939 INFO L87 Difference]: Start difference. First operand 92 states and 107 transitions. Second operand 13 states. [2019-11-25 08:54:51,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:51,914 INFO L93 Difference]: Finished difference Result 93 states and 107 transitions. [2019-11-25 08:54:51,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:54:51,915 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-11-25 08:54:51,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:51,916 INFO L225 Difference]: With dead ends: 93 [2019-11-25 08:54:51,916 INFO L226 Difference]: Without dead ends: 93 [2019-11-25 08:54:51,916 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-11-25 08:54:51,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-25 08:54:51,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2019-11-25 08:54:51,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-25 08:54:51,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 105 transitions. [2019-11-25 08:54:51,921 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 105 transitions. Word has length 24 [2019-11-25 08:54:51,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:51,921 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 105 transitions. [2019-11-25 08:54:51,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-25 08:54:51,921 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2019-11-25 08:54:51,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-25 08:54:51,922 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:51,922 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:52,125 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:54:52,125 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-25 08:54:52,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:52,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1343445713, now seen corresponding path program 1 times [2019-11-25 08:54:52,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:54:52,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [17608345] [2019-11-25 08:54:52,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2871c15d-dcc6-4a2f-b890-734ce5e97cdf/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-25 08:54:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:52,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 08:54:52,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:52,337 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 11 treesize of output 7 [2019-11-25 08:54:52,337 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:52,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:52,340 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:54:52,340 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-11-25 08:54:52,362 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-25 08:54:52,362 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:52,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:52,364 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-25 08:54:52,364 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-25 08:54:52,372 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-25 08:54:52,373 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:54:52,461 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 28 treesize of output 24 [2019-11-25 08:54:52,461 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-25 08:54:52,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:52,468 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-25 08:54:52,468 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2019-11-25 08:54:52,478 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-25 08:54:52,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [17608345] [2019-11-25 08:54:52,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:52,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 7 [2019-11-25 08:54:52,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484400293] [2019-11-25 08:54:52,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:54:52,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:54:52,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:54:52,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:54:52,480 INFO L87 Difference]: Start difference. First operand 91 states and 105 transitions. Second operand 8 states. [2019-11-25 08:54:52,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:52,703 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2019-11-25 08:54:52,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:54:52,704 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-11-25 08:54:52,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:52,705 INFO L225 Difference]: With dead ends: 92 [2019-11-25 08:54:52,705 INFO L226 Difference]: Without dead ends: 92 [2019-11-25 08:54:52,705 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:54:52,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-25 08:54:52,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2019-11-25 08:54:52,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-25 08:54:52,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2019-11-25 08:54:52,709 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 27 [2019-11-25 08:54:52,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:52,709 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2019-11-25 08:54:52,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:54:52,710 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2019-11-25 08:54:52,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-25 08:54:52,710 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:52,710 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:52,911 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:54:52,911 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-25 08:54:52,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:52,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1302855748, now seen corresponding path program 1 times [2019-11-25 08:54:52,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:54:52,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [184462736] [2019-11-25 08:54:52,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2871c15d-dcc6-4a2f-b890-734ce5e97cdf/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-25 08:54:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:53,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 08:54:53,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:53,222 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 11 treesize of output 7 [2019-11-25 08:54:53,222 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:53,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:53,232 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-25 08:54:53,232 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:11 [2019-11-25 08:54:53,267 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-25 08:54:53,267 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:53,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:53,272 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-25 08:54:53,272 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-11-25 08:54:53,290 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-25 08:54:53,290 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:54:53,425 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 28 treesize of output 24 [2019-11-25 08:54:53,426 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-25 08:54:53,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:53,458 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:54:53,458 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:24 [2019-11-25 08:54:53,525 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-25 08:54:53,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [184462736] [2019-11-25 08:54:53,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:53,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 5] imperfect sequences [] total 11 [2019-11-25 08:54:53,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755649037] [2019-11-25 08:54:53,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 08:54:53,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:54:53,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 08:54:53,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:54:53,527 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand 12 states. [2019-11-25 08:54:54,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:54,050 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2019-11-25 08:54:54,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:54:54,051 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-11-25 08:54:54,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:54,052 INFO L225 Difference]: With dead ends: 91 [2019-11-25 08:54:54,052 INFO L226 Difference]: Without dead ends: 91 [2019-11-25 08:54:54,052 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:54:54,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-25 08:54:54,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2019-11-25 08:54:54,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-25 08:54:54,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2019-11-25 08:54:54,056 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 101 transitions. Word has length 28 [2019-11-25 08:54:54,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:54,056 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 101 transitions. [2019-11-25 08:54:54,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 08:54:54,056 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 101 transitions. [2019-11-25 08:54:54,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-25 08:54:54,057 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:54,057 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:54,264 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:54:54,265 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-25 08:54:54,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:54,265 INFO L82 PathProgramCache]: Analyzing trace with hash -988227321, now seen corresponding path program 1 times [2019-11-25 08:54:54,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:54:54,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [742402389] [2019-11-25 08:54:54,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2871c15d-dcc6-4a2f-b890-734ce5e97cdf/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-25 08:54:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:54,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-25 08:54:54,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:54,526 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-25 08:54:54,526 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:54,538 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:54,538 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:54:54,538 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-11-25 08:54:54,555 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 11 treesize of output 7 [2019-11-25 08:54:54,555 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:54,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:54,561 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-25 08:54:54,561 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-11-25 08:54:54,614 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:54,614 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 18 treesize of output 46 [2019-11-25 08:54:54,615 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:54,640 INFO L567 ElimStorePlain]: treesize reduction 26, result has 40.9 percent of original size [2019-11-25 08:54:54,640 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:54:54,641 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:18 [2019-11-25 08:54:54,705 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-11-25 08:54:54,706 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2019-11-25 08:54:54,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:54,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:54,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:54:54,714 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-11-25 08:54:54,760 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:54,760 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 26 [2019-11-25 08:54:54,761 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:54,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:54,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:54:54,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:13 [2019-11-25 08:54:54,790 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:54:54,791 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:54:54,973 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 32 treesize of output 28 [2019-11-25 08:54:54,973 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-25 08:54:54,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:54,993 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:54:54,993 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:28 [2019-11-25 08:54:55,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:54:55,114 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:55,114 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 15 treesize of output 19 [2019-11-25 08:54:55,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:55,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:55,126 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:55,127 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 15 treesize of output 19 [2019-11-25 08:54:55,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:55,128 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:55,148 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:55,148 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-25 08:54:55,149 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:7 [2019-11-25 08:54:55,158 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 10 treesize of output 8 [2019-11-25 08:54:55,158 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:55,166 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 10 treesize of output 8 [2019-11-25 08:54:55,166 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:55,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:55,173 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-25 08:54:55,173 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 [2019-11-25 08:54:55,179 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:54:55,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [742402389] [2019-11-25 08:54:55,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:54:55,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2019-11-25 08:54:55,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704263703] [2019-11-25 08:54:55,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-25 08:54:55,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:54:55,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-25 08:54:55,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-11-25 08:54:55,181 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. Second operand 17 states. [2019-11-25 08:54:56,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:56,437 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2019-11-25 08:54:56,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-25 08:54:56,438 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2019-11-25 08:54:56,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:56,439 INFO L225 Difference]: With dead ends: 97 [2019-11-25 08:54:56,439 INFO L226 Difference]: Without dead ends: 97 [2019-11-25 08:54:56,439 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2019-11-25 08:54:56,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-25 08:54:56,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2019-11-25 08:54:56,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-25 08:54:56,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2019-11-25 08:54:56,443 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 29 [2019-11-25 08:54:56,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:56,444 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2019-11-25 08:54:56,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-25 08:54:56,444 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2019-11-25 08:54:56,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-25 08:54:56,445 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:56,445 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:56,645 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:54:56,646 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-25 08:54:56,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:56,646 INFO L82 PathProgramCache]: Analyzing trace with hash -988227320, now seen corresponding path program 1 times [2019-11-25 08:54:56,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:54:56,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1369515570] [2019-11-25 08:54:56,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2871c15d-dcc6-4a2f-b890-734ce5e97cdf/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-25 08:54:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:56,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-25 08:54:56,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:56,941 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-25 08:54:56,941 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:56,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:56,958 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-25 08:54:56,958 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:56,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:56,970 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:54:56,971 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2019-11-25 08:54:56,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:54:56,998 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-25 08:54:56,998 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:57,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:57,032 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:57,032 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-25 08:54:57,033 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:57,051 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:57,052 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-25 08:54:57,052 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2019-11-25 08:54:57,132 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-25 08:54:57,132 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:57,151 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:57,154 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 11 treesize of output 7 [2019-11-25 08:54:57,155 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:57,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:57,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:54:57,175 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:45 [2019-11-25 08:54:57,320 INFO L392 ElimStorePlain]: Different costs {1=[|v_#valid_165|], 3=[|v_#length_104|]} [2019-11-25 08:54:57,333 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:57,334 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2019-11-25 08:54:57,334 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:57,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:57,383 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:57,383 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 40 [2019-11-25 08:54:57,384 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:57,436 INFO L567 ElimStorePlain]: treesize reduction 14, result has 76.7 percent of original size [2019-11-25 08:54:57,437 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-25 08:54:57,437 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:46 [2019-11-25 08:54:57,541 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-11-25 08:54:57,541 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2019-11-25 08:54:57,541 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:57,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:57,576 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-11-25 08:54:57,576 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2019-11-25 08:54:57,577 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:57,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:57,592 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:54:57,592 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:52 [2019-11-25 08:54:57,644 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:57,644 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 28 [2019-11-25 08:54:57,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:57,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:57,669 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:57,669 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 26 treesize of output 22 [2019-11-25 08:54:57,670 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:57,693 INFO L567 ElimStorePlain]: treesize reduction 12, result has 62.5 percent of original size [2019-11-25 08:54:57,694 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:54:57,694 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:66, output treesize:20 [2019-11-25 08:54:57,733 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:54:57,733 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:54:58,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:54:58,853 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 72 treesize of output 68 [2019-11-25 08:54:58,853 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-25 08:54:58,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:58,954 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 108 treesize of output 100 [2019-11-25 08:54:58,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:54:58,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:58,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:58,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:58,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:54:58,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:58,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:58,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:58,957 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-25 08:54:59,195 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-11-25 08:54:59,196 INFO L567 ElimStorePlain]: treesize reduction 56, result has 65.6 percent of original size [2019-11-25 08:54:59,212 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 38 treesize of output 34 [2019-11-25 08:54:59,213 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:59,319 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-25 08:54:59,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:59,339 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 46 treesize of output 38 [2019-11-25 08:54:59,342 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:59,449 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-25 08:54:59,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:59,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:59,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:54:59,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:54:59,452 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2019-11-25 08:54:59,452 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:104, output treesize:85 [2019-11-25 08:54:59,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:59,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:54:59,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:54:59,723 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-11-25 08:54:59,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:59,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:54:59,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:54:59,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:54:59,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:59,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:54:59,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:54:59,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:59,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:54:59,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:00,010 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:00,010 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 20 treesize of output 24 [2019-11-25 08:55:00,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:00,036 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:00,036 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 31 treesize of output 35 [2019-11-25 08:55:00,037 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:00,061 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:00,061 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 33 treesize of output 37 [2019-11-25 08:55:00,061 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:00,084 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:00,084 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 18 treesize of output 22 [2019-11-25 08:55:00,085 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:00,117 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:00,117 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 26 treesize of output 30 [2019-11-25 08:55:00,117 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:00,134 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:00,134 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 26 treesize of output 30 [2019-11-25 08:55:00,135 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:00,323 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-11-25 08:55:00,324 INFO L567 ElimStorePlain]: treesize reduction 24, result has 76.2 percent of original size [2019-11-25 08:55:00,324 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 5 xjuncts. [2019-11-25 08:55:00,325 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:155, output treesize:69 [2019-11-25 08:55:00,713 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 24 [2019-11-25 08:55:00,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:00,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:55:00,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:00,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:01,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:55:01,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:01,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:01,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:55:01,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:01,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:01,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:55:01,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:01,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:01,993 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:01,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1369515570] [2019-11-25 08:55:01,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:55:01,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2019-11-25 08:55:01,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029820220] [2019-11-25 08:55:01,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-25 08:55:01,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:55:01,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-25 08:55:01,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-11-25 08:55:01,996 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand 21 states. [2019-11-25 08:55:03,169 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2019-11-25 08:55:03,750 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 47 [2019-11-25 08:55:05,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:05,772 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2019-11-25 08:55:05,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-25 08:55:05,773 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2019-11-25 08:55:05,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:05,774 INFO L225 Difference]: With dead ends: 96 [2019-11-25 08:55:05,774 INFO L226 Difference]: Without dead ends: 96 [2019-11-25 08:55:05,774 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2019-11-25 08:55:05,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-25 08:55:05,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2019-11-25 08:55:05,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-25 08:55:05,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2019-11-25 08:55:05,778 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 29 [2019-11-25 08:55:05,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:05,778 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2019-11-25 08:55:05,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-25 08:55:05,778 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2019-11-25 08:55:05,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-25 08:55:05,779 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:05,779 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:05,979 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:55:05,980 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-25 08:55:05,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:05,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1733822413, now seen corresponding path program 1 times [2019-11-25 08:55:05,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:55:05,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1440025083] [2019-11-25 08:55:05,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2871c15d-dcc6-4a2f-b890-734ce5e97cdf/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-25 08:55:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:06,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 08:55:06,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:06,194 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-25 08:55:06,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:06,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:06,205 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:55:06,205 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-11-25 08:55:06,227 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 11 treesize of output 7 [2019-11-25 08:55:06,227 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:06,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:06,232 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-25 08:55:06,232 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-11-25 08:55:06,254 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 11 [2019-11-25 08:55:06,254 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:06,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:06,256 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-25 08:55:06,256 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2019-11-25 08:55:06,266 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-25 08:55:06,266 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:55:06,363 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 32 treesize of output 28 [2019-11-25 08:55:06,363 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-25 08:55:06,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:06,384 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:55:06,385 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:28 [2019-11-25 08:55:06,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:06,460 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 10 treesize of output 8 [2019-11-25 08:55:06,460 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:06,464 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 10 treesize of output 8 [2019-11-25 08:55:06,464 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:06,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:06,468 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-25 08:55:06,469 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 [2019-11-25 08:55:06,473 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-25 08:55:06,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1440025083] [2019-11-25 08:55:06,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:06,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 9 [2019-11-25 08:55:06,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322298459] [2019-11-25 08:55:06,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 08:55:06,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:55:06,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:55:06,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:55:06,475 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand 10 states. [2019-11-25 08:55:06,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:06,782 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2019-11-25 08:55:06,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:55:06,783 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-11-25 08:55:06,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:06,783 INFO L225 Difference]: With dead ends: 93 [2019-11-25 08:55:06,783 INFO L226 Difference]: Without dead ends: 93 [2019-11-25 08:55:06,784 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:55:06,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-25 08:55:06,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2019-11-25 08:55:06,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-25 08:55:06,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2019-11-25 08:55:06,787 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 29 [2019-11-25 08:55:06,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:06,787 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2019-11-25 08:55:06,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 08:55:06,788 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2019-11-25 08:55:06,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-25 08:55:06,788 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:06,789 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:06,989 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:55:06,990 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-25 08:55:06,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:06,991 INFO L82 PathProgramCache]: Analyzing trace with hash 2086080159, now seen corresponding path program 1 times [2019-11-25 08:55:06,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:55:06,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [977078130] [2019-11-25 08:55:06,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2871c15d-dcc6-4a2f-b890-734ce5e97cdf/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-25 08:55:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:07,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-25 08:55:07,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:07,259 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-25 08:55:07,260 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:07,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:07,264 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:55:07,264 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 08:55:07,297 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-25 08:55:07,297 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:07,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:07,304 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:55:07,304 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:12 [2019-11-25 08:55:07,308 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 11 treesize of output 7 [2019-11-25 08:55:07,308 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:07,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:07,315 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-25 08:55:07,315 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-11-25 08:55:07,334 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:07,335 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 15 treesize of output 19 [2019-11-25 08:55:07,335 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:07,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:07,341 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:55:07,342 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-11-25 08:55:07,370 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 16 treesize of output 8 [2019-11-25 08:55:07,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:07,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:07,378 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:55:07,378 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2019-11-25 08:55:07,404 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-25 08:55:07,405 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:07,421 INFO L567 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-11-25 08:55:07,421 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-25 08:55:07,422 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2019-11-25 08:55:07,446 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-25 08:55:07,446 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:55:07,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:55:07,676 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 28 treesize of output 24 [2019-11-25 08:55:07,676 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:07,680 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 23 treesize of output 21 [2019-11-25 08:55:07,680 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:07,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:07,698 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 8 treesize of output 6 [2019-11-25 08:55:07,698 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:07,700 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:07,701 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:55:07,701 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:52, output treesize:6 [2019-11-25 08:55:07,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:55:07,756 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 31 treesize of output 29 [2019-11-25 08:55:07,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:07,769 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:07,770 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-25 08:55:07,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:55:07,770 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:07,794 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:07,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:07,800 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 31 treesize of output 27 [2019-11-25 08:55:07,800 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:07,859 INFO L567 ElimStorePlain]: treesize reduction 5, result has 85.7 percent of original size [2019-11-25 08:55:07,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-25 08:55:07,859 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:54, output treesize:30 [2019-11-25 08:55:07,896 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 19 treesize of output 17 [2019-11-25 08:55:07,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:07,900 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 18 treesize of output 16 [2019-11-25 08:55:07,900 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:07,904 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 18 treesize of output 16 [2019-11-25 08:55:07,904 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:07,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:07,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-11-25 08:55:07,921 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:56, output treesize:38 [2019-11-25 08:55:07,962 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-25 08:55:07,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [977078130] [2019-11-25 08:55:07,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:07,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2019-11-25 08:55:07,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318184795] [2019-11-25 08:55:07,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-25 08:55:07,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:55:07,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-25 08:55:07,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:55:07,963 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand 14 states. [2019-11-25 08:55:12,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:12,423 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2019-11-25 08:55:12,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 08:55:12,423 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2019-11-25 08:55:12,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:12,424 INFO L225 Difference]: With dead ends: 108 [2019-11-25 08:55:12,424 INFO L226 Difference]: Without dead ends: 108 [2019-11-25 08:55:12,425 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2019-11-25 08:55:12,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-25 08:55:12,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 90. [2019-11-25 08:55:12,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-25 08:55:12,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-11-25 08:55:12,428 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 30 [2019-11-25 08:55:12,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:12,429 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-11-25 08:55:12,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-25 08:55:12,429 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-11-25 08:55:12,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-25 08:55:12,430 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:12,430 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:12,630 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:55:12,631 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-25 08:55:12,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:12,631 INFO L82 PathProgramCache]: Analyzing trace with hash 2086080160, now seen corresponding path program 1 times [2019-11-25 08:55:12,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:55:12,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [349391023] [2019-11-25 08:55:12,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2871c15d-dcc6-4a2f-b890-734ce5e97cdf/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-25 08:55:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:12,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:55:12,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:12,797 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-25 08:55:12,797 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:55:12,803 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-25 08:55:12,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [349391023] [2019-11-25 08:55:12,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:12,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-25 08:55:12,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392756979] [2019-11-25 08:55:12,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:12,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:55:12,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:12,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:12,804 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 3 states. [2019-11-25 08:55:12,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:12,898 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2019-11-25 08:55:12,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:12,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-25 08:55:12,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:12,899 INFO L225 Difference]: With dead ends: 88 [2019-11-25 08:55:12,899 INFO L226 Difference]: Without dead ends: 88 [2019-11-25 08:55:12,900 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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-25 08:55:12,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-25 08:55:12,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2019-11-25 08:55:12,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-25 08:55:12,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2019-11-25 08:55:12,903 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 30 [2019-11-25 08:55:12,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:12,903 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2019-11-25 08:55:12,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:55:12,903 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2019-11-25 08:55:12,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-25 08:55:12,904 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:12,904 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:13,104 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:55:13,105 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-25 08:55:13,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:13,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1190830857, now seen corresponding path program 1 times [2019-11-25 08:55:13,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:55:13,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1809834312] [2019-11-25 08:55:13,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2871c15d-dcc6-4a2f-b890-734ce5e97cdf/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-25 08:55:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:13,580 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-25 08:55:13,580 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:55:13,785 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:55:13,801 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-11-25 08:55:13,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:55:13 BoogieIcfgContainer [2019-11-25 08:55:13,821 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:55:13,822 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:55:13,822 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:55:13,823 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:55:13,823 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:54:39" (3/4) ... [2019-11-25 08:55:13,826 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-25 08:55:13,827 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:55:13,828 INFO L168 Benchmark]: Toolchain (without parser) took 35913.73 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.0 MB). Free memory was 944.7 MB in the beginning and 934.2 MB in the end (delta: 10.5 MB). Peak memory consumption was 324.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:13,828 INFO L168 Benchmark]: CDTParser took 0.23 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-25 08:55:13,829 INFO L168 Benchmark]: CACSL2BoogieTranslator took 492.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -136.1 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:13,829 INFO L168 Benchmark]: Boogie Preprocessor took 65.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:13,830 INFO L168 Benchmark]: RCFGBuilder took 1004.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.3 MB). Peak memory consumption was 64.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:13,830 INFO L168 Benchmark]: TraceAbstraction took 34341.37 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 209.7 MB). Free memory was 1.0 GB in the beginning and 934.2 MB in the end (delta: 80.5 MB). Peak memory consumption was 290.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:13,831 INFO L168 Benchmark]: Witness Printer took 5.16 ms. Allocated memory is still 1.3 GB. Free memory is still 934.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:55:13,833 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.23 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 492.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -136.1 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1004.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.3 MB). Peak memory consumption was 64.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 34341.37 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 209.7 MB). Free memory was 1.0 GB in the beginning and 934.2 MB in the end (delta: 80.5 MB). Peak memory consumption was 290.3 MB. Max. memory is 11.5 GB. * Witness Printer took 5.16 ms. Allocated memory is still 1.3 GB. Free memory is still 934.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 528]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 528. Possible FailurePath: [L513] int c = 0; VAL [\old(c)=0, c=0] [L530] struct item *list = ((void *)0); [L531] int length = 0; VAL [\old(c)=0, c=0, length=0, list={1766850560:0}] [L533] CALL append(&list) VAL [\old(c)=0, c=0, plist={1766850560:0}] [L520] c++ [L521] struct item *item = malloc(sizeof *item); VAL [\old(c)=0, c=1, item={-693671939:0}, malloc(sizeof *item)={-693671939:0}, plist={1766850560:0}, plist={1766850560:0}] [L522] EXPR \read(**plist) VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={-693671939:0}, malloc(sizeof *item)={-693671939:0}, plist={1766850560:0}, plist={1766850560:0}] [L522] item->next = *plist VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={-693671939:0}, malloc(sizeof *item)={-693671939:0}, plist={1766850560:0}, plist={1766850560:0}] [L523] EXPR item->next VAL [\old(c)=0, c=1, item={-693671939:0}, item->next={0:0}, malloc(sizeof *item)={-693671939:0}, plist={1766850560:0}, plist={1766850560:0}] [L523-L525] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L523-L525] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-2141192192:0}, \old(c)=0, c=1, item={-693671939:0}, item->next={0:0}, malloc(sizeof *item)={-2141192192:0}, malloc(sizeof *item)={-693671939:0}, plist={1766850560:0}, plist={1766850560:0}] [L523-L525] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-2141192192:0}, \old(c)=0, c=1, item={-693671939:0}, item->next={0:0}, malloc(sizeof *item)={-2141192192:0}, malloc(sizeof *item)={-693671939:0}, plist={1766850560:0}, plist={1766850560:0}] [L526] *plist = item VAL [\old(c)=0, c=1, item={-693671939:0}, malloc(sizeof *item)={-2141192192:0}, malloc(sizeof *item)={-693671939:0}, plist={1766850560:0}, plist={1766850560:0}] [L533] RET append(&list) VAL [\old(c)=0, c=1, length=0, list={1766850560:0}] [L534] length++ VAL [\old(c)=0, c=1, length=1, list={1766850560:0}] [L535] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L536] COND TRUE length > 0 VAL [\old(c)=0, c=1, length=1, list={1766850560:0}] [L537] COND FALSE !(length < 0) VAL [\old(c)=0, c=1, length=1, list={1766850560:0}] [L540] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={-693671939:0}, c=1, length=1, list={1766850560:0}] [L540] EXPR list->next VAL [\old(c)=0, \read(*list)={-693671939:0}, c=1, length=1, list={1766850560:0}, list->next={0:0}] [L540] struct item *next = list->next; [L541] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={-693671939:0}, c=1, length=1, list={1766850560:0}, next={0:0}] [L541] free(list) VAL [\old(c)=0, \read(*list)={-693671939:0}, c=1, length=1, list={1766850560:0}, next={0:0}] [L541] free(list) VAL [\old(c)=0, \read(*list)={-693671939:0}, c=1, length=1, list={1766850560:0}, next={0:0}] [L541] free(list) [L542] list = next VAL [\old(c)=0, c=1, length=1, list={1766850560:0}, next={0:0}] [L543] length-- VAL [\old(c)=0, c=1, length=0, list={1766850560:0}, next={0:0}] [L545] COND FALSE !(length > 0) VAL [\old(c)=0, c=1, length=0, list={1766850560:0}, next={0:0}] [L551] return 0; [L530] struct item *list = ((void *)0); [L551] return 0; VAL [\old(c)=0, \result=0, c=1, length=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 119 locations, 44 error locations. Result: UNSAFE, OverallTime: 34.2s, OverallIterations: 17, TraceHistogramMax: 2, AutomataDifference: 16.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 866 SDtfs, 1232 SDslu, 3120 SDs, 0 SdLazy, 2927 SolverSat, 184 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 13.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 730 GetRequests, 549 SyntacticMatches, 18 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 118 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 385 NumberOfCodeBlocks, 385 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 670 ConstructedInterpolants, 55 QuantifiedInterpolants, 166636 SizeOfPredicates, 153 NumberOfNonLiveVariables, 1834 ConjunctsInSsa, 187 ConjunctsInUnsatCore, 32 InterpolantComputations, 28 PerfectInterpolantSequences, 8/28 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...