./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 701f399f Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 64bit --witnessprinter.graph.data.programhash 129dca108ba5ab1702fbcd782a34bbf933adb446 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-701f399 [2019-11-22 09:43:05,309 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 09:43:05,312 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 09:43:05,331 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 09:43:05,332 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 09:43:05,335 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 09:43:05,337 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 09:43:05,348 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 09:43:05,354 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 09:43:05,357 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 09:43:05,359 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 09:43:05,361 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 09:43:05,361 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 09:43:05,365 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 09:43:05,366 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 09:43:05,368 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 09:43:05,369 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 09:43:05,370 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 09:43:05,373 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 09:43:05,379 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 09:43:05,383 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 09:43:05,388 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 09:43:05,389 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 09:43:05,391 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 09:43:05,395 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 09:43:05,395 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 09:43:05,396 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 09:43:05,398 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 09:43:05,399 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 09:43:05,400 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 09:43:05,400 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 09:43:05,401 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 09:43:05,402 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 09:43:05,403 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 09:43:05,405 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 09:43:05,405 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 09:43:05,406 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 09:43:05,407 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 09:43:05,407 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 09:43:05,408 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 09:43:05,409 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 09:43:05,410 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2019-11-22 09:43:05,445 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 09:43:05,445 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 09:43:05,446 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 09:43:05,450 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 09:43:05,450 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 09:43:05,451 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 09:43:05,451 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 09:43:05,451 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 09:43:05,451 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 09:43:05,452 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 09:43:05,452 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 09:43:05,452 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 09:43:05,453 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 09:43:05,454 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 09:43:05,454 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-22 09:43:05,455 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-22 09:43:05,455 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 09:43:05,455 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 09:43:05,455 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 09:43:05,456 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 09:43:05,456 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 09:43:05,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 09:43:05,457 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 09:43:05,457 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 09:43:05,458 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-22 09:43:05,458 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-22 09:43:05,458 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-22 09:43:05,458 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 129dca108ba5ab1702fbcd782a34bbf933adb446 [2019-11-22 09:43:05,798 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 09:43:05,817 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 09:43:05,823 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 09:43:05,825 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 09:43:05,825 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 09:43:05,826 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2019-11-22 09:43:05,899 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf87c77b7/21d735621d694da3a3ddc1c91e870b67/FLAG490bd3e18 [2019-11-22 09:43:06,412 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 09:43:06,413 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2019-11-22 09:43:06,427 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf87c77b7/21d735621d694da3a3ddc1c91e870b67/FLAG490bd3e18 [2019-11-22 09:43:06,760 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf87c77b7/21d735621d694da3a3ddc1c91e870b67 [2019-11-22 09:43:06,764 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 09:43:06,765 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 09:43:06,769 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 09:43:06,769 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 09:43:06,774 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 09:43:06,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:43:06" (1/1) ... [2019-11-22 09:43:06,778 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76bb17a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:43:06, skipping insertion in model container [2019-11-22 09:43:06,778 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:43:06" (1/1) ... [2019-11-22 09:43:06,787 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 09:43:06,830 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-22 09:43:07,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 09:43:07,351 INFO L201 MainTranslator]: Completed pre-run [2019-11-22 09:43:07,436 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 09:43:07,548 INFO L205 MainTranslator]: Completed translation [2019-11-22 09:43:07,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:43:07 WrapperNode [2019-11-22 09:43:07,550 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 09:43:07,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 09:43:07,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 09:43:07,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 09:43:07,566 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:43:07" (1/1) ... [2019-11-22 09:43:07,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:43:07" (1/1) ... [2019-11-22 09:43:07,617 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:43:07" (1/1) ... [2019-11-22 09:43:07,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:43:07" (1/1) ... [2019-11-22 09:43:07,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:43:07" (1/1) ... [2019-11-22 09:43:07,668 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:43:07" (1/1) ... [2019-11-22 09:43:07,682 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:43:07" (1/1) ... [2019-11-22 09:43:07,697 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 09:43:07,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 09:43:07,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 09:43:07,703 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 09:43:07,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:43:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 09:43:07,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 09:43:07,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 09:43:07,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2019-11-22 09:43:07,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 09:43:07,790 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-22 09:43:07,791 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-22 09:43:07,792 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2019-11-22 09:43:07,792 INFO L138 BoogieDeclarations]: Found implementation of procedure c1 [2019-11-22 09:43:07,793 INFO L138 BoogieDeclarations]: Found implementation of procedure c2 [2019-11-22 09:43:07,793 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 09:43:07,793 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-22 09:43:07,794 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-22 09:43:07,795 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-22 09:43:07,795 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-22 09:43:07,795 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-22 09:43:07,795 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-22 09:43:07,795 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-22 09:43:07,798 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-22 09:43:07,798 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-22 09:43:07,798 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-22 09:43:07,799 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-22 09:43:07,799 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-22 09:43:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-22 09:43:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-22 09:43:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-22 09:43:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-22 09:43:07,802 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-22 09:43:07,802 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-22 09:43:07,802 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-22 09:43:07,802 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-22 09:43:07,803 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-22 09:43:07,803 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-22 09:43:07,803 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-22 09:43:07,803 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-22 09:43:07,803 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-22 09:43:07,803 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-22 09:43:07,804 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-22 09:43:07,804 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-22 09:43:07,804 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-22 09:43:07,804 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-22 09:43:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-22 09:43:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-22 09:43:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-22 09:43:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-22 09:43:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-22 09:43:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-22 09:43:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-22 09:43:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-22 09:43:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-22 09:43:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-22 09:43:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-22 09:43:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-22 09:43:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-22 09:43:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-22 09:43:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-22 09:43:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-22 09:43:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-22 09:43:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-22 09:43:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-22 09:43:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-22 09:43:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-22 09:43:07,808 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-22 09:43:07,808 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-22 09:43:07,808 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 09:43:07,808 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-22 09:43:07,808 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 09:43:07,808 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-22 09:43:07,808 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-22 09:43:07,808 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-22 09:43:07,809 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-22 09:43:07,809 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-22 09:43:07,809 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-22 09:43:07,809 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-22 09:43:07,809 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-22 09:43:07,809 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-22 09:43:07,809 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-22 09:43:07,810 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-22 09:43:07,810 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-22 09:43:07,810 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-22 09:43:07,810 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-22 09:43:07,810 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-22 09:43:07,810 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-22 09:43:07,810 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-22 09:43:07,810 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-22 09:43:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-22 09:43:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-22 09:43:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-22 09:43:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-22 09:43:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-22 09:43:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-22 09:43:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-22 09:43:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-22 09:43:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-22 09:43:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-22 09:43:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-22 09:43:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-22 09:43:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-22 09:43:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-22 09:43:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-22 09:43:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-22 09:43:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-22 09:43:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-22 09:43:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-22 09:43:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-22 09:43:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-22 09:43:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-22 09:43:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-22 09:43:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-22 09:43:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-22 09:43:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-22 09:43:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-22 09:43:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-22 09:43:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-22 09:43:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-22 09:43:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-22 09:43:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-22 09:43:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2019-11-22 09:43:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure memccpy [2019-11-22 09:43:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-22 09:43:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-11-22 09:43:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure memchr [2019-11-22 09:43:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2019-11-22 09:43:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-11-22 09:43:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2019-11-22 09:43:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure strncat [2019-11-22 09:43:07,816 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2019-11-22 09:43:07,816 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2019-11-22 09:43:07,816 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll [2019-11-22 09:43:07,816 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm [2019-11-22 09:43:07,816 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll_l [2019-11-22 09:43:07,816 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm_l [2019-11-22 09:43:07,817 INFO L130 BoogieDeclarations]: Found specification of procedure strdup [2019-11-22 09:43:07,818 INFO L130 BoogieDeclarations]: Found specification of procedure strndup [2019-11-22 09:43:07,821 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2019-11-22 09:43:07,821 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2019-11-22 09:43:07,821 INFO L130 BoogieDeclarations]: Found specification of procedure strcspn [2019-11-22 09:43:07,821 INFO L130 BoogieDeclarations]: Found specification of procedure strspn [2019-11-22 09:43:07,822 INFO L130 BoogieDeclarations]: Found specification of procedure strpbrk [2019-11-22 09:43:07,822 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2019-11-22 09:43:07,822 INFO L130 BoogieDeclarations]: Found specification of procedure strtok [2019-11-22 09:43:07,823 INFO L130 BoogieDeclarations]: Found specification of procedure __strtok_r [2019-11-22 09:43:07,823 INFO L130 BoogieDeclarations]: Found specification of procedure strtok_r [2019-11-22 09:43:07,823 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-11-22 09:43:07,823 INFO L130 BoogieDeclarations]: Found specification of procedure strnlen [2019-11-22 09:43:07,824 INFO L130 BoogieDeclarations]: Found specification of procedure strerror [2019-11-22 09:43:07,830 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_r [2019-11-22 09:43:07,830 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_l [2019-11-22 09:43:07,830 INFO L130 BoogieDeclarations]: Found specification of procedure __bzero [2019-11-22 09:43:07,830 INFO L130 BoogieDeclarations]: Found specification of procedure bcopy [2019-11-22 09:43:07,831 INFO L130 BoogieDeclarations]: Found specification of procedure bzero [2019-11-22 09:43:07,831 INFO L130 BoogieDeclarations]: Found specification of procedure bcmp [2019-11-22 09:43:07,831 INFO L130 BoogieDeclarations]: Found specification of procedure index [2019-11-22 09:43:07,831 INFO L130 BoogieDeclarations]: Found specification of procedure rindex [2019-11-22 09:43:07,831 INFO L130 BoogieDeclarations]: Found specification of procedure ffs [2019-11-22 09:43:07,831 INFO L130 BoogieDeclarations]: Found specification of procedure strcasecmp [2019-11-22 09:43:07,831 INFO L130 BoogieDeclarations]: Found specification of procedure strncasecmp [2019-11-22 09:43:07,831 INFO L130 BoogieDeclarations]: Found specification of procedure strsep [2019-11-22 09:43:07,832 INFO L130 BoogieDeclarations]: Found specification of procedure strsignal [2019-11-22 09:43:07,832 INFO L130 BoogieDeclarations]: Found specification of procedure __stpcpy [2019-11-22 09:43:07,832 INFO L130 BoogieDeclarations]: Found specification of procedure stpcpy [2019-11-22 09:43:07,832 INFO L130 BoogieDeclarations]: Found specification of procedure __stpncpy [2019-11-22 09:43:07,832 INFO L130 BoogieDeclarations]: Found specification of procedure stpncpy [2019-11-22 09:43:07,832 INFO L130 BoogieDeclarations]: Found specification of procedure c1 [2019-11-22 09:43:07,832 INFO L130 BoogieDeclarations]: Found specification of procedure c2 [2019-11-22 09:43:07,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-22 09:43:07,834 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2019-11-22 09:43:07,835 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2019-11-22 09:43:07,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-22 09:43:07,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-11-22 09:43:07,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 09:43:07,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 09:43:07,835 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 09:43:07,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 09:43:07,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2019-11-22 09:43:07,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-22 09:43:07,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 09:43:07,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 09:43:07,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-11-22 09:43:07,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-22 09:43:08,679 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 09:43:08,680 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-22 09:43:08,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:43:08 BoogieIcfgContainer [2019-11-22 09:43:08,681 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 09:43:08,682 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 09:43:08,683 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 09:43:08,686 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 09:43:08,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:43:06" (1/3) ... [2019-11-22 09:43:08,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b7966e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:43:08, skipping insertion in model container [2019-11-22 09:43:08,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:43:07" (2/3) ... [2019-11-22 09:43:08,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b7966e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:43:08, skipping insertion in model container [2019-11-22 09:43:08,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:43:08" (3/3) ... [2019-11-22 09:43:08,689 INFO L109 eAbstractionObserver]: Analyzing ICFG bftpd_2.i [2019-11-22 09:43:08,699 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 09:43:08,707 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-11-22 09:43:08,719 INFO L249 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-11-22 09:43:08,742 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 09:43:08,742 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 09:43:08,742 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 09:43:08,742 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 09:43:08,742 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 09:43:08,743 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 09:43:08,743 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 09:43:08,743 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 09:43:08,763 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2019-11-22 09:43:08,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 09:43:08,772 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:43:08,773 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:43:08,774 INFO L410 AbstractCegarLoop]: === Iteration 1 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:43:08,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:43:08,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1137100954, now seen corresponding path program 1 times [2019-11-22 09:43:08,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:43:08,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [304807335] [2019-11-22 09:43:08,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 09:43:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:43:09,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-22 09:43:09,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:43:09,529 WARN L192 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 33 [2019-11-22 09:43:09,532 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-22 09:43:09,533 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 24 treesize of output 65 [2019-11-22 09:43:09,534 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:09,635 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-11-22 09:43:09,636 INFO L567 ElimStorePlain]: treesize reduction 10, result has 84.6 percent of original size [2019-11-22 09:43:09,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:09,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 09:43:09,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:24, output treesize:55 [2019-11-22 09:43:09,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:09,690 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-22 09:43:09,690 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:43:09,729 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-22 09:43:09,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [304807335] [2019-11-22 09:43:09,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:43:09,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-22 09:43:09,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188706697] [2019-11-22 09:43:09,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 09:43:09,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:43:09,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 09:43:09,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 09:43:09,758 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2019-11-22 09:43:09,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:43:09,935 INFO L93 Difference]: Finished difference Result 93 states and 107 transitions. [2019-11-22 09:43:09,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 09:43:09,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-22 09:43:09,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:43:09,951 INFO L225 Difference]: With dead ends: 93 [2019-11-22 09:43:09,951 INFO L226 Difference]: Without dead ends: 87 [2019-11-22 09:43:09,953 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 09:43:09,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-22 09:43:10,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2019-11-22 09:43:10,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-22 09:43:10,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2019-11-22 09:43:10,012 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 99 transitions. Word has length 9 [2019-11-22 09:43:10,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:43:10,013 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 99 transitions. [2019-11-22 09:43:10,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 09:43:10,013 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2019-11-22 09:43:10,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 09:43:10,015 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:43:10,019 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:43:10,222 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:43:10,225 INFO L410 AbstractCegarLoop]: === Iteration 2 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:43:10,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:43:10,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1137100953, now seen corresponding path program 1 times [2019-11-22 09:43:10,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:43:10,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1055075291] [2019-11-22 09:43:10,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 09:43:10,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:43:10,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-22 09:43:10,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:43:11,073 WARN L192 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-22 09:43:11,074 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-22 09:43:11,074 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2019-11-22 09:43:11,076 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:11,226 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2019-11-22 09:43:11,229 INFO L567 ElimStorePlain]: treesize reduction 50, result has 51.9 percent of original size [2019-11-22 09:43:11,231 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:43:11,232 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:9 [2019-11-22 09:43:11,267 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-22 09:43:11,267 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:43:11,490 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-22 09:43:11,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1055075291] [2019-11-22 09:43:11,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:43:11,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-22 09:43:11,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032411730] [2019-11-22 09:43:11,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 09:43:11,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:43:11,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 09:43:11,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-22 09:43:11,494 INFO L87 Difference]: Start difference. First operand 83 states and 99 transitions. Second operand 6 states. [2019-11-22 09:43:12,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:43:12,077 INFO L93 Difference]: Finished difference Result 172 states and 231 transitions. [2019-11-22 09:43:12,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 09:43:12,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-11-22 09:43:12,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:43:12,083 INFO L225 Difference]: With dead ends: 172 [2019-11-22 09:43:12,083 INFO L226 Difference]: Without dead ends: 172 [2019-11-22 09:43:12,084 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-22 09:43:12,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-11-22 09:43:12,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 140. [2019-11-22 09:43:12,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-22 09:43:12,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 200 transitions. [2019-11-22 09:43:12,112 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 200 transitions. Word has length 9 [2019-11-22 09:43:12,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:43:12,113 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 200 transitions. [2019-11-22 09:43:12,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 09:43:12,113 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 200 transitions. [2019-11-22 09:43:12,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 09:43:12,114 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:43:12,114 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:43:12,317 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:43:12,318 INFO L410 AbstractCegarLoop]: === Iteration 3 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:43:12,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:43:12,318 INFO L82 PathProgramCache]: Analyzing trace with hash -890391164, now seen corresponding path program 1 times [2019-11-22 09:43:12,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:43:12,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1757780651] [2019-11-22 09:43:12,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 09:43:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:43:12,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-22 09:43:12,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:43:13,339 WARN L192 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 66 [2019-11-22 09:43:13,340 INFO L343 Elim1Store]: treesize reduction 591, result has 19.8 percent of original size [2019-11-22 09:43:13,341 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 15 case distinctions, treesize of input 325 treesize of output 419 [2019-11-22 09:43:13,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,600 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:14,513 WARN L192 SmtUtils]: Spent 911.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 66 [2019-11-22 09:43:14,517 INFO L567 ElimStorePlain]: treesize reduction 6909, result has 2.3 percent of original size [2019-11-22 09:43:14,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:14,524 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 09:43:14,524 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:146, output treesize:166 [2019-11-22 09:43:14,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:14,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:14,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:14,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:14,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:14,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:15,140 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 55 [2019-11-22 09:43:15,184 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 44 [2019-11-22 09:43:15,185 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-22 09:43:15,299 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-11-22 09:43:15,300 INFO L567 ElimStorePlain]: treesize reduction 5, result has 93.3 percent of original size [2019-11-22 09:43:15,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 09:43:15,302 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:124, output treesize:70 [2019-11-22 09:43:15,347 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-22 09:43:15,347 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:43:15,734 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-22 09:43:15,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1757780651] [2019-11-22 09:43:15,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:43:15,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-22 09:43:15,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846262364] [2019-11-22 09:43:15,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 09:43:15,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:43:15,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 09:43:15,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-22 09:43:15,736 INFO L87 Difference]: Start difference. First operand 140 states and 200 transitions. Second operand 8 states. [2019-11-22 09:43:15,982 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-11-22 09:43:16,244 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-11-22 09:43:16,616 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 73 [2019-11-22 09:43:17,320 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 66 [2019-11-22 09:43:17,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:43:17,964 INFO L93 Difference]: Finished difference Result 292 states and 423 transitions. [2019-11-22 09:43:17,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 09:43:17,967 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-11-22 09:43:17,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:43:17,970 INFO L225 Difference]: With dead ends: 292 [2019-11-22 09:43:17,970 INFO L226 Difference]: Without dead ends: 292 [2019-11-22 09:43:17,971 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-11-22 09:43:17,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-11-22 09:43:18,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 226. [2019-11-22 09:43:18,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-22 09:43:18,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 339 transitions. [2019-11-22 09:43:18,014 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 339 transitions. Word has length 10 [2019-11-22 09:43:18,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:43:18,014 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 339 transitions. [2019-11-22 09:43:18,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 09:43:18,015 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 339 transitions. [2019-11-22 09:43:18,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-22 09:43:18,016 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:43:18,016 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:43:18,218 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:43:18,219 INFO L410 AbstractCegarLoop]: === Iteration 4 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:43:18,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:43:18,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1832322202, now seen corresponding path program 1 times [2019-11-22 09:43:18,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:43:18,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2053717499] [2019-11-22 09:43:18,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 09:43:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:43:18,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-22 09:43:18,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:43:18,722 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_52|], 12=[|v_#valid_69|]} [2019-11-22 09:43:18,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:18,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:18,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:18,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:18,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:18,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:18,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:19,109 WARN L192 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-11-22 09:43:19,110 INFO L343 Elim1Store]: treesize reduction 72, result has 65.4 percent of original size [2019-11-22 09:43:19,111 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 141 [2019-11-22 09:43:19,112 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:19,389 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-11-22 09:43:19,390 INFO L567 ElimStorePlain]: treesize reduction 70, result has 71.2 percent of original size [2019-11-22 09:43:19,460 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:19,461 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 266 treesize of output 288 [2019-11-22 09:43:19,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:19,495 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:20,378 WARN L192 SmtUtils]: Spent 882.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 68 [2019-11-22 09:43:20,379 INFO L567 ElimStorePlain]: treesize reduction 2940, result has 5.0 percent of original size [2019-11-22 09:43:20,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:20,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:20,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:20,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:20,384 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 09:43:20,384 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:134, output treesize:155 [2019-11-22 09:43:20,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:20,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:20,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:20,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:20,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:20,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:20,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:20,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:20,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:20,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:20,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:20,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:20,574 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 09:43:20,574 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:20,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:20,601 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 119 [2019-11-22 09:43:20,602 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:20,641 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:20,642 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 128 [2019-11-22 09:43:20,642 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:20,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:20,672 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 118 [2019-11-22 09:43:20,673 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:20,699 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 09:43:20,701 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 114 [2019-11-22 09:43:20,702 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:20,738 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:20,739 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 128 [2019-11-22 09:43:20,740 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:20,750 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 09:43:20,750 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:20,778 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 111 [2019-11-22 09:43:20,779 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:20,792 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 09:43:20,792 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:20,816 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 111 [2019-11-22 09:43:20,817 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:20,854 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:20,855 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 131 [2019-11-22 09:43:20,855 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:20,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:20,878 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 114 [2019-11-22 09:43:20,879 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:21,389 WARN L192 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-11-22 09:43:21,390 INFO L567 ElimStorePlain]: treesize reduction 698, result has 31.2 percent of original size [2019-11-22 09:43:21,394 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2019-11-22 09:43:21,394 INFO L221 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:1531, output treesize:316 [2019-11-22 09:43:21,706 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-11-22 09:43:21,988 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-22 09:43:21,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:43:22,033 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 61 [2019-11-22 09:43:22,034 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-22 09:43:22,248 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-11-22 09:43:22,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:22,274 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 58 treesize of output 50 [2019-11-22 09:43:22,275 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:22,436 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-11-22 09:43:22,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:22,455 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 81 treesize of output 73 [2019-11-22 09:43:22,456 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:22,707 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-22 09:43:22,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:22,720 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 58 [2019-11-22 09:43:22,721 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-22 09:43:22,942 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-22 09:43:22,942 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:22,967 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 53 treesize of output 45 [2019-11-22 09:43:22,968 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:23,128 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-22 09:43:23,129 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:23,143 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 50 [2019-11-22 09:43:23,144 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:23,268 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-22 09:43:23,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:23,271 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 6 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-11-22 09:43:23,272 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 14 variables, input treesize:249, output treesize:129 [2019-11-22 09:43:23,426 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-11-22 09:43:23,435 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-22 09:43:23,435 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:43:23,685 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-22 09:43:23,788 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-22 09:43:23,924 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-22 09:43:24,037 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-22 09:43:24,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2053717499] [2019-11-22 09:43:24,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:43:24,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2019-11-22 09:43:24,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973982754] [2019-11-22 09:43:24,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-22 09:43:24,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:43:24,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-22 09:43:24,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-22 09:43:24,039 INFO L87 Difference]: Start difference. First operand 226 states and 339 transitions. Second operand 9 states. [2019-11-22 09:43:24,359 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 80 [2019-11-22 09:43:24,747 WARN L192 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 91 [2019-11-22 09:43:26,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:43:26,272 INFO L93 Difference]: Finished difference Result 412 states and 600 transitions. [2019-11-22 09:43:26,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 09:43:26,273 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2019-11-22 09:43:26,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:43:26,278 INFO L225 Difference]: With dead ends: 412 [2019-11-22 09:43:26,278 INFO L226 Difference]: Without dead ends: 412 [2019-11-22 09:43:26,279 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-11-22 09:43:26,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2019-11-22 09:43:26,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 343. [2019-11-22 09:43:26,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-11-22 09:43:26,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 545 transitions. [2019-11-22 09:43:26,326 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 545 transitions. Word has length 11 [2019-11-22 09:43:26,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:43:26,326 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 545 transitions. [2019-11-22 09:43:26,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-22 09:43:26,326 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 545 transitions. [2019-11-22 09:43:26,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-22 09:43:26,327 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:43:26,327 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:43:26,531 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:43:26,531 INFO L410 AbstractCegarLoop]: === Iteration 5 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:43:26,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:43:26,532 INFO L82 PathProgramCache]: Analyzing trace with hash -967413306, now seen corresponding path program 1 times [2019-11-22 09:43:26,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:43:26,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1061069921] [2019-11-22 09:43:26,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 09:43:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:43:26,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 09:43:26,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:43:27,284 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 48 [2019-11-22 09:43:27,284 INFO L343 Elim1Store]: treesize reduction 355, result has 19.1 percent of original size [2019-11-22 09:43:27,285 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 1568 treesize of output 1562 [2019-11-22 09:43:27,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:27,442 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:28,595 WARN L192 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 229 DAG size of output: 64 [2019-11-22 09:43:28,596 INFO L567 ElimStorePlain]: treesize reduction 58523, result has 0.2 percent of original size [2019-11-22 09:43:28,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:28,601 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 09:43:28,601 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:85, output treesize:103 [2019-11-22 09:43:28,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:28,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:28,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:28,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:28,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:29,228 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 51 [2019-11-22 09:43:29,447 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-22 09:43:29,448 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:43:29,710 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-22 09:43:29,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1061069921] [2019-11-22 09:43:29,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:43:29,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-22 09:43:29,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205006214] [2019-11-22 09:43:29,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 09:43:29,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:43:29,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 09:43:29,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-22 09:43:29,711 INFO L87 Difference]: Start difference. First operand 343 states and 545 transitions. Second operand 10 states. [2019-11-22 09:43:30,762 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-11-22 09:43:31,906 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-11-22 09:43:33,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:43:33,010 INFO L93 Difference]: Finished difference Result 433 states and 653 transitions. [2019-11-22 09:43:33,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 09:43:33,011 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-11-22 09:43:33,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:43:33,015 INFO L225 Difference]: With dead ends: 433 [2019-11-22 09:43:33,015 INFO L226 Difference]: Without dead ends: 433 [2019-11-22 09:43:33,015 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-22 09:43:33,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-11-22 09:43:33,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 381. [2019-11-22 09:43:33,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-11-22 09:43:33,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 599 transitions. [2019-11-22 09:43:33,048 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 599 transitions. Word has length 12 [2019-11-22 09:43:33,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:43:33,048 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 599 transitions. [2019-11-22 09:43:33,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 09:43:33,048 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 599 transitions. [2019-11-22 09:43:33,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-22 09:43:33,049 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:43:33,049 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:43:33,253 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:43:33,254 INFO L410 AbstractCegarLoop]: === Iteration 6 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:43:33,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:43:33,255 INFO L82 PathProgramCache]: Analyzing trace with hash 74958696, now seen corresponding path program 1 times [2019-11-22 09:43:33,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:43:33,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [687517091] [2019-11-22 09:43:33,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 09:43:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:43:33,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-22 09:43:33,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:43:33,672 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_65|], 18=[|v_#valid_85|]} [2019-11-22 09:43:33,693 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:33,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:33,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:33,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:33,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:33,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:33,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:33,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:33,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:33,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:33,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:33,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:33,760 INFO L343 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2019-11-22 09:43:33,761 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 31 [2019-11-22 09:43:33,761 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:33,864 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-22 09:43:33,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:33,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:33,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:33,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:33,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:33,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:33,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:33,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:33,927 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:33,927 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 158 [2019-11-22 09:43:33,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:33,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:33,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:33,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:33,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:33,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:33,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:33,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:33,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:33,934 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:34,332 WARN L192 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-11-22 09:43:34,333 INFO L567 ElimStorePlain]: treesize reduction 166, result has 27.2 percent of original size [2019-11-22 09:43:34,334 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 09:43:34,334 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:85, output treesize:62 [2019-11-22 09:43:34,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:43:34,609 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:43:34,928 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-22 09:43:34,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [687517091] [2019-11-22 09:43:34,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:43:34,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-22 09:43:34,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232890325] [2019-11-22 09:43:34,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 09:43:34,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:43:34,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 09:43:34,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-22 09:43:34,929 INFO L87 Difference]: Start difference. First operand 381 states and 599 transitions. Second operand 8 states. [2019-11-22 09:43:35,120 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-11-22 09:43:38,893 WARN L192 SmtUtils]: Spent 3.29 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-11-22 09:43:40,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:43:40,110 INFO L93 Difference]: Finished difference Result 441 states and 624 transitions. [2019-11-22 09:43:40,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 09:43:40,112 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-11-22 09:43:40,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:43:40,115 INFO L225 Difference]: With dead ends: 441 [2019-11-22 09:43:40,116 INFO L226 Difference]: Without dead ends: 441 [2019-11-22 09:43:40,116 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-22 09:43:40,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-11-22 09:43:40,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 383. [2019-11-22 09:43:40,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-11-22 09:43:40,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 595 transitions. [2019-11-22 09:43:40,142 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 595 transitions. Word has length 13 [2019-11-22 09:43:40,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:43:40,143 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 595 transitions. [2019-11-22 09:43:40,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 09:43:40,143 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 595 transitions. [2019-11-22 09:43:40,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 09:43:40,144 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:43:40,144 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:43:40,349 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:43:40,349 INFO L410 AbstractCegarLoop]: === Iteration 7 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:43:40,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:43:40,350 INFO L82 PathProgramCache]: Analyzing trace with hash -456233619, now seen corresponding path program 1 times [2019-11-22 09:43:40,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:43:40,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1177522090] [2019-11-22 09:43:40,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 09:43:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:43:40,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-22 09:43:40,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:43:40,903 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_73|], 15=[|v_#valid_93|]} [2019-11-22 09:43:40,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:40,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:40,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:40,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:40,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:40,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:40,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:40,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:40,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:41,321 WARN L192 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-11-22 09:43:41,321 INFO L343 Elim1Store]: treesize reduction 28, result has 81.1 percent of original size [2019-11-22 09:43:41,322 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 125 [2019-11-22 09:43:41,323 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:41,552 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-11-22 09:43:41,553 INFO L567 ElimStorePlain]: treesize reduction 62, result has 69.9 percent of original size [2019-11-22 09:43:41,619 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:41,620 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 392 treesize of output 402 [2019-11-22 09:43:41,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:41,705 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:43,032 WARN L192 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 248 DAG size of output: 64 [2019-11-22 09:43:43,033 INFO L567 ElimStorePlain]: treesize reduction 7690, result has 1.6 percent of original size [2019-11-22 09:43:43,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,039 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 09:43:43,040 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:109, output treesize:129 [2019-11-22 09:43:43,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:43,775 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-11-22 09:43:44,290 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-22 09:43:44,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:44,352 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 87 [2019-11-22 09:43:44,353 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:44,730 WARN L192 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-11-22 09:43:44,731 INFO L567 ElimStorePlain]: treesize reduction 48, result has 73.9 percent of original size [2019-11-22 09:43:44,751 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 56 [2019-11-22 09:43:44,751 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:44,885 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-22 09:43:44,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:44,900 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 63 treesize of output 55 [2019-11-22 09:43:44,900 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:45,010 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-22 09:43:45,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:45,019 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 52 treesize of output 44 [2019-11-22 09:43:45,020 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:45,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:45,112 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-11-22 09:43:45,112 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:195, output treesize:92 [2019-11-22 09:43:45,207 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:43:45,207 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:43:45,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:43:45,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1177522090] [2019-11-22 09:43:45,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 09:43:45,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-11-22 09:43:45,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652713364] [2019-11-22 09:43:45,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 09:43:45,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:43:45,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 09:43:45,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-22 09:43:45,736 INFO L87 Difference]: Start difference. First operand 383 states and 595 transitions. Second operand 10 states. [2019-11-22 09:43:46,049 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-22 09:43:46,710 WARN L192 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 100 [2019-11-22 09:43:49,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:43:49,165 INFO L93 Difference]: Finished difference Result 520 states and 767 transitions. [2019-11-22 09:43:49,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-22 09:43:49,167 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-22 09:43:49,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:43:49,171 INFO L225 Difference]: With dead ends: 520 [2019-11-22 09:43:49,171 INFO L226 Difference]: Without dead ends: 520 [2019-11-22 09:43:49,172 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 11 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-11-22 09:43:49,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-11-22 09:43:49,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 421. [2019-11-22 09:43:49,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-11-22 09:43:49,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 658 transitions. [2019-11-22 09:43:49,195 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 658 transitions. Word has length 19 [2019-11-22 09:43:49,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:43:49,195 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 658 transitions. [2019-11-22 09:43:49,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 09:43:49,196 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 658 transitions. [2019-11-22 09:43:49,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-22 09:43:49,196 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:43:49,197 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] [2019-11-22 09:43:49,402 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:43:49,403 INFO L410 AbstractCegarLoop]: === Iteration 8 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:43:49,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:43:49,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1646608229, now seen corresponding path program 1 times [2019-11-22 09:43:49,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:43:49,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [146212057] [2019-11-22 09:43:49,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 09:43:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:43:49,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-22 09:43:49,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:43:49,674 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-22 09:43:49,674 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:43:49,680 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-22 09:43:49,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [146212057] [2019-11-22 09:43:49,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:43:49,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-22 09:43:49,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353755294] [2019-11-22 09:43:49,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 09:43:49,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:43:49,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 09:43:49,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 09:43:49,682 INFO L87 Difference]: Start difference. First operand 421 states and 658 transitions. Second operand 3 states. [2019-11-22 09:43:49,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:43:49,691 INFO L93 Difference]: Finished difference Result 322 states and 473 transitions. [2019-11-22 09:43:49,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 09:43:49,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-22 09:43:49,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:43:49,694 INFO L225 Difference]: With dead ends: 322 [2019-11-22 09:43:49,694 INFO L226 Difference]: Without dead ends: 322 [2019-11-22 09:43:49,694 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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-22 09:43:49,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-22 09:43:49,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 317. [2019-11-22 09:43:49,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-11-22 09:43:49,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 464 transitions. [2019-11-22 09:43:49,709 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 464 transitions. Word has length 23 [2019-11-22 09:43:49,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:43:49,710 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 464 transitions. [2019-11-22 09:43:49,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 09:43:49,710 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 464 transitions. [2019-11-22 09:43:49,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-22 09:43:49,712 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:43:49,713 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-22 09:43:49,915 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:43:49,916 INFO L410 AbstractCegarLoop]: === Iteration 9 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:43:49,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:43:49,916 INFO L82 PathProgramCache]: Analyzing trace with hash -407602741, now seen corresponding path program 1 times [2019-11-22 09:43:49,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:43:49,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [701843901] [2019-11-22 09:43:49,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 09:43:50,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:43:50,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-22 09:43:50,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:43:50,168 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-22 09:43:50,168 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:43:50,177 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-22 09:43:50,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [701843901] [2019-11-22 09:43:50,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:43:50,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-22 09:43:50,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303143488] [2019-11-22 09:43:50,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 09:43:50,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:43:50,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 09:43:50,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 09:43:50,180 INFO L87 Difference]: Start difference. First operand 317 states and 464 transitions. Second operand 3 states. [2019-11-22 09:43:50,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:43:50,207 INFO L93 Difference]: Finished difference Result 421 states and 621 transitions. [2019-11-22 09:43:50,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 09:43:50,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-22 09:43:50,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:43:50,210 INFO L225 Difference]: With dead ends: 421 [2019-11-22 09:43:50,210 INFO L226 Difference]: Without dead ends: 421 [2019-11-22 09:43:50,210 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-22 09:43:50,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-11-22 09:43:50,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 411. [2019-11-22 09:43:50,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-11-22 09:43:50,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 619 transitions. [2019-11-22 09:43:50,225 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 619 transitions. Word has length 24 [2019-11-22 09:43:50,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:43:50,226 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 619 transitions. [2019-11-22 09:43:50,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 09:43:50,226 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 619 transitions. [2019-11-22 09:43:50,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-22 09:43:50,227 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:43:50,227 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] [2019-11-22 09:43:50,429 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:43:50,432 INFO L410 AbstractCegarLoop]: === Iteration 10 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:43:50,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:43:50,433 INFO L82 PathProgramCache]: Analyzing trace with hash 249216982, now seen corresponding path program 1 times [2019-11-22 09:43:50,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:43:50,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1652180346] [2019-11-22 09:43:50,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 09:43:50,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:43:50,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-22 09:43:50,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:43:50,723 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-22 09:43:50,724 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:43:50,739 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-22 09:43:50,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1652180346] [2019-11-22 09:43:50,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:43:50,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-22 09:43:50,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950115949] [2019-11-22 09:43:50,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 09:43:50,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:43:50,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 09:43:50,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 09:43:50,741 INFO L87 Difference]: Start difference. First operand 411 states and 619 transitions. Second operand 4 states. [2019-11-22 09:43:50,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:43:50,794 INFO L93 Difference]: Finished difference Result 358 states and 502 transitions. [2019-11-22 09:43:50,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 09:43:50,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-22 09:43:50,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:43:50,798 INFO L225 Difference]: With dead ends: 358 [2019-11-22 09:43:50,798 INFO L226 Difference]: Without dead ends: 356 [2019-11-22 09:43:50,798 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-22 09:43:50,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-11-22 09:43:50,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 342. [2019-11-22 09:43:50,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-11-22 09:43:50,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 491 transitions. [2019-11-22 09:43:50,810 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 491 transitions. Word has length 25 [2019-11-22 09:43:50,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:43:50,810 INFO L462 AbstractCegarLoop]: Abstraction has 342 states and 491 transitions. [2019-11-22 09:43:50,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 09:43:50,811 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 491 transitions. [2019-11-22 09:43:50,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-22 09:43:50,812 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:43:50,812 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:43:51,014 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:43:51,023 INFO L410 AbstractCegarLoop]: === Iteration 11 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:43:51,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:43:51,023 INFO L82 PathProgramCache]: Analyzing trace with hash -567996427, now seen corresponding path program 1 times [2019-11-22 09:43:51,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:43:51,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [676573935] [2019-11-22 09:43:51,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 09:43:51,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:43:51,370 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 09:43:51,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:43:51,398 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:43:51,399 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:43:51,457 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:43:51,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [676573935] [2019-11-22 09:43:51,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 09:43:51,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-22 09:43:51,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210403904] [2019-11-22 09:43:51,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 09:43:51,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:43:51,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 09:43:51,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-22 09:43:51,459 INFO L87 Difference]: Start difference. First operand 342 states and 491 transitions. Second operand 8 states. [2019-11-22 09:43:51,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:43:51,615 INFO L93 Difference]: Finished difference Result 365 states and 506 transitions. [2019-11-22 09:43:51,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 09:43:51,617 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-11-22 09:43:51,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:43:51,620 INFO L225 Difference]: With dead ends: 365 [2019-11-22 09:43:51,620 INFO L226 Difference]: Without dead ends: 365 [2019-11-22 09:43:51,621 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-22 09:43:51,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-11-22 09:43:51,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 315. [2019-11-22 09:43:51,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-11-22 09:43:51,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 421 transitions. [2019-11-22 09:43:51,636 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 421 transitions. Word has length 25 [2019-11-22 09:43:51,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:43:51,636 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 421 transitions. [2019-11-22 09:43:51,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 09:43:51,637 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 421 transitions. [2019-11-22 09:43:51,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-22 09:43:51,638 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:43:51,638 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:43:51,843 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:43:51,843 INFO L410 AbstractCegarLoop]: === Iteration 12 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:43:51,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:43:51,844 INFO L82 PathProgramCache]: Analyzing trace with hash 2031405767, now seen corresponding path program 1 times [2019-11-22 09:43:51,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:43:51,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1712996866] [2019-11-22 09:43:51,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 09:43:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:43:52,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-22 09:43:52,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:43:52,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:43:52,122 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:43:52,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:43:52,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1712996866] [2019-11-22 09:43:52,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:43:52,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-22 09:43:52,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271363306] [2019-11-22 09:43:52,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 09:43:52,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:43:52,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 09:43:52,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 09:43:52,180 INFO L87 Difference]: Start difference. First operand 315 states and 421 transitions. Second operand 3 states. [2019-11-22 09:43:52,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:43:52,190 INFO L93 Difference]: Finished difference Result 229 states and 292 transitions. [2019-11-22 09:43:52,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 09:43:52,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-22 09:43:52,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:43:52,192 INFO L225 Difference]: With dead ends: 229 [2019-11-22 09:43:52,192 INFO L226 Difference]: Without dead ends: 229 [2019-11-22 09:43:52,193 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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-22 09:43:52,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-11-22 09:43:52,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2019-11-22 09:43:52,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-11-22 09:43:52,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 292 transitions. [2019-11-22 09:43:52,200 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 292 transitions. Word has length 33 [2019-11-22 09:43:52,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:43:52,201 INFO L462 AbstractCegarLoop]: Abstraction has 229 states and 292 transitions. [2019-11-22 09:43:52,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 09:43:52,201 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 292 transitions. [2019-11-22 09:43:52,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-22 09:43:52,202 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:43:52,202 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:43:52,404 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:43:52,405 INFO L410 AbstractCegarLoop]: === Iteration 13 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:43:52,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:43:52,405 INFO L82 PathProgramCache]: Analyzing trace with hash -245427548, now seen corresponding path program 1 times [2019-11-22 09:43:52,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:43:52,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2146540409] [2019-11-22 09:43:52,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 09:43:52,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:43:52,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 09:43:52,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:43:53,217 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 33 [2019-11-22 09:43:53,218 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-22 09:43:53,218 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 7 case distinctions, treesize of input 72 treesize of output 110 [2019-11-22 09:43:53,219 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:53,357 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-11-22 09:43:53,357 INFO L567 ElimStorePlain]: treesize reduction 36, result has 66.4 percent of original size [2019-11-22 09:43:53,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:53,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 09:43:53,360 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:71 [2019-11-22 09:43:53,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:53,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:53,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:53,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:53,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:53,850 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-22 09:43:53,851 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:53,852 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 60 treesize of output 136 [2019-11-22 09:43:53,853 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:54,009 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:54,010 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 58 treesize of output 134 [2019-11-22 09:43:54,011 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:54,169 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:54,170 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 60 treesize of output 136 [2019-11-22 09:43:54,171 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:54,188 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 09:43:54,188 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:54,197 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 09:43:54,197 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:54,201 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 09:43:54,202 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:54,311 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:54,312 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 58 treesize of output 134 [2019-11-22 09:43:54,313 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:54,383 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:54,383 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-22 09:43:54,384 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:422, output treesize:12 [2019-11-22 09:43:54,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:54,604 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 31 [2019-11-22 09:43:54,676 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-22 09:43:54,677 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:43:54,969 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-22 09:43:54,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2146540409] [2019-11-22 09:43:54,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 09:43:54,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2019-11-22 09:43:54,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138246452] [2019-11-22 09:43:54,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-22 09:43:54,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:43:54,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-22 09:43:54,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-22 09:43:54,972 INFO L87 Difference]: Start difference. First operand 229 states and 292 transitions. Second operand 14 states. [2019-11-22 09:43:58,216 WARN L192 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-11-22 09:44:03,271 WARN L192 SmtUtils]: Spent 3.00 s on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-11-22 09:44:05,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:44:05,300 INFO L93 Difference]: Finished difference Result 323 states and 385 transitions. [2019-11-22 09:44:05,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 09:44:05,301 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2019-11-22 09:44:05,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:44:05,303 INFO L225 Difference]: With dead ends: 323 [2019-11-22 09:44:05,303 INFO L226 Difference]: Without dead ends: 317 [2019-11-22 09:44:05,304 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-11-22 09:44:05,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-11-22 09:44:05,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 282. [2019-11-22 09:44:05,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-11-22 09:44:05,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 358 transitions. [2019-11-22 09:44:05,315 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 358 transitions. Word has length 33 [2019-11-22 09:44:05,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:44:05,316 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 358 transitions. [2019-11-22 09:44:05,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-22 09:44:05,316 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 358 transitions. [2019-11-22 09:44:05,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-22 09:44:05,318 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:44:05,318 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:44:05,522 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:05,523 INFO L410 AbstractCegarLoop]: === Iteration 14 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:44:05,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:44:05,523 INFO L82 PathProgramCache]: Analyzing trace with hash -330240892, now seen corresponding path program 1 times [2019-11-22 09:44:05,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:44:05,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1129700625] [2019-11-22 09:44:05,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 09:44:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:44:06,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-22 09:44:06,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:44:06,565 WARN L192 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-22 09:44:06,567 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-22 09:44:06,567 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2019-11-22 09:44:06,568 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:06,719 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-11-22 09:44:06,720 INFO L567 ElimStorePlain]: treesize reduction 50, result has 53.3 percent of original size [2019-11-22 09:44:06,720 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:44:06,720 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:28, output treesize:12 [2019-11-22 09:44:06,744 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 7 treesize of output 5 [2019-11-22 09:44:06,744 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:06,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:06,754 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:44:06,754 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:10 [2019-11-22 09:44:06,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:06,850 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-22 09:44:06,851 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:06,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:06,874 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 09:44:06,874 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:22 [2019-11-22 09:44:06,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:44:06,944 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:44:07,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:07,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:08,022 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 27 [2019-11-22 09:44:08,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:08,239 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:08,240 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-22 09:44:08,246 INFO L168 Benchmark]: Toolchain (without parser) took 61481.45 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 416.8 MB). Free memory was 957.7 MB in the beginning and 1.4 GB in the end (delta: -398.3 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-11-22 09:44:08,247 INFO L168 Benchmark]: CDTParser took 0.58 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 09:44:08,247 INFO L168 Benchmark]: CACSL2BoogieTranslator took 780.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -139.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-22 09:44:08,248 INFO L168 Benchmark]: Boogie Preprocessor took 149.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-22 09:44:08,248 INFO L168 Benchmark]: RCFGBuilder took 981.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.1 MB). Peak memory consumption was 65.1 MB. Max. memory is 11.5 GB. [2019-11-22 09:44:08,248 INFO L168 Benchmark]: TraceAbstraction took 59562.33 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 287.3 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -330.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 09:44:08,250 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.58 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 780.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -139.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 149.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 981.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.1 MB). Peak memory consumption was 65.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 59562.33 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 287.3 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -330.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...