./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext/tree_cnstr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 678e0110 Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_cnstr.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5d0e37f725f553afaea418dbbe7c392bdc4622ea ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 08:11:15,857 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 08:11:15,858 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 08:11:15,872 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 08:11:15,873 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 08:11:15,874 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 08:11:15,876 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 08:11:15,885 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 08:11:15,889 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 08:11:15,893 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 08:11:15,894 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 08:11:15,895 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 08:11:15,895 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 08:11:15,897 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 08:11:15,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 08:11:15,899 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 08:11:15,900 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 08:11:15,901 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 08:11:15,903 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 08:11:15,906 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 08:11:15,910 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 08:11:15,912 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 08:11:15,915 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 08:11:15,916 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 08:11:15,919 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 08:11:15,920 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 08:11:15,920 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 08:11:15,921 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 08:11:15,922 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 08:11:15,923 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 08:11:15,923 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 08:11:15,924 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 08:11:15,924 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 08:11:15,925 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 08:11:15,926 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 08:11:15,926 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 08:11:15,927 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 08:11:15,927 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 08:11:15,927 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 08:11:15,928 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 08:11:15,929 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 08:11:15,930 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-20 08:11:15,953 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 08:11:15,954 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 08:11:15,954 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 08:11:15,955 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 08:11:15,955 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 08:11:15,955 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 08:11:15,955 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 08:11:15,955 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 08:11:15,956 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 08:11:15,956 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 08:11:15,956 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 08:11:15,956 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-20 08:11:15,956 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-20 08:11:15,957 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-20 08:11:15,957 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 08:11:15,957 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 08:11:15,957 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 08:11:15,957 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 08:11:15,957 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 08:11:15,958 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 08:11:15,958 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 08:11:15,958 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 08:11:15,958 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 08:11:15,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 08:11:15,959 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 08:11:15,959 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 08:11:15,959 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 08:11:15,959 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 08:11:15,959 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 08:11:15,959 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5d0e37f725f553afaea418dbbe7c392bdc4622ea [2019-11-20 08:11:16,111 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 08:11:16,121 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 08:11:16,124 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 08:11:16,125 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 08:11:16,126 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 08:11:16,127 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer/../../sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2019-11-20 08:11:16,180 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer/data/8a09eda94/7629d51ed23b431aae6f9f552f2101a4/FLAGe9c19c188 [2019-11-20 08:11:16,703 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 08:11:16,704 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2019-11-20 08:11:16,718 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer/data/8a09eda94/7629d51ed23b431aae6f9f552f2101a4/FLAGe9c19c188 [2019-11-20 08:11:17,195 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer/data/8a09eda94/7629d51ed23b431aae6f9f552f2101a4 [2019-11-20 08:11:17,198 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 08:11:17,199 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-20 08:11:17,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 08:11:17,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 08:11:17,204 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 08:11:17,205 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:11:17" (1/1) ... [2019-11-20 08:11:17,207 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36d3d969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:17, skipping insertion in model container [2019-11-20 08:11:17,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:11:17" (1/1) ... [2019-11-20 08:11:17,214 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 08:11:17,275 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 08:11:17,604 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 08:11:17,612 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 08:11:17,679 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 08:11:17,730 INFO L192 MainTranslator]: Completed translation [2019-11-20 08:11:17,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:17 WrapperNode [2019-11-20 08:11:17,731 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 08:11:17,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 08:11:17,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 08:11:17,733 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 08:11:17,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:17" (1/1) ... [2019-11-20 08:11:17,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:17" (1/1) ... [2019-11-20 08:11:17,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:17" (1/1) ... [2019-11-20 08:11:17,761 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:17" (1/1) ... [2019-11-20 08:11:17,786 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:17" (1/1) ... [2019-11-20 08:11:17,800 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:17" (1/1) ... [2019-11-20 08:11:17,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:17" (1/1) ... [2019-11-20 08:11:17,811 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 08:11:17,812 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 08:11:17,812 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 08:11:17,812 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 08:11:17,813 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 08:11:17,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-20 08:11:17,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 08:11:17,875 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-20 08:11:17,876 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-20 08:11:17,876 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-20 08:11:17,876 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-20 08:11:17,877 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-20 08:11:17,878 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-20 08:11:17,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-20 08:11:17,879 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-20 08:11:17,879 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-20 08:11:17,879 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-20 08:11:17,879 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-20 08:11:17,880 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-20 08:11:17,880 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-20 08:11:17,880 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-20 08:11:17,881 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-20 08:11:17,881 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-20 08:11:17,881 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-20 08:11:17,881 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-20 08:11:17,883 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-20 08:11:17,883 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-20 08:11:17,883 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-20 08:11:17,883 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-20 08:11:17,883 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-20 08:11:17,883 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-20 08:11:17,884 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-20 08:11:17,884 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-20 08:11:17,884 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-20 08:11:17,884 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-20 08:11:17,884 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-20 08:11:17,884 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-20 08:11:17,884 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-20 08:11:17,885 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-20 08:11:17,885 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-20 08:11:17,885 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-20 08:11:17,885 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-20 08:11:17,885 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-20 08:11:17,885 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-20 08:11:17,885 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-20 08:11:17,886 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-20 08:11:17,886 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-20 08:11:17,886 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-20 08:11:17,886 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-20 08:11:17,886 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-20 08:11:17,886 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-20 08:11:17,886 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-20 08:11:17,886 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-20 08:11:17,886 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-20 08:11:17,887 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-20 08:11:17,887 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-20 08:11:17,887 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-20 08:11:17,887 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-20 08:11:17,887 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-20 08:11:17,887 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-20 08:11:17,887 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-20 08:11:17,887 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-20 08:11:17,887 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-20 08:11:17,887 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-20 08:11:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-20 08:11:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-20 08:11:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-20 08:11:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-20 08:11:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-20 08:11:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-20 08:11:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-20 08:11:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-20 08:11:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-20 08:11:17,889 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-20 08:11:17,889 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-20 08:11:17,889 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-20 08:11:17,889 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-20 08:11:17,889 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-20 08:11:17,890 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-20 08:11:17,890 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-20 08:11:17,890 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-20 08:11:17,890 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-20 08:11:17,890 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-20 08:11:17,890 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-20 08:11:17,890 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-20 08:11:17,891 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-20 08:11:17,891 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-20 08:11:17,891 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-20 08:11:17,891 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-20 08:11:17,891 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-20 08:11:17,891 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-20 08:11:17,891 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-20 08:11:17,892 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-20 08:11:17,892 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-20 08:11:17,892 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-20 08:11:17,892 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-20 08:11:17,892 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-20 08:11:17,892 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-20 08:11:17,892 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-20 08:11:17,892 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-20 08:11:17,893 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-20 08:11:17,893 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-20 08:11:17,893 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-20 08:11:17,893 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-20 08:11:17,893 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-20 08:11:17,893 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-20 08:11:17,893 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-20 08:11:17,893 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-20 08:11:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-20 08:11:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-20 08:11:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-20 08:11:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-20 08:11:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-20 08:11:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-20 08:11:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-20 08:11:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-20 08:11:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-20 08:11:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-20 08:11:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-20 08:11:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-20 08:11:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-20 08:11:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-20 08:11:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-20 08:11:17,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 08:11:17,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 08:11:17,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 08:11:17,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 08:11:17,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-20 08:11:17,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 08:11:18,750 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 08:11:18,750 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-20 08:11:18,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:11:18 BoogieIcfgContainer [2019-11-20 08:11:18,751 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 08:11:18,752 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 08:11:18,752 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 08:11:18,754 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 08:11:18,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:11:17" (1/3) ... [2019-11-20 08:11:18,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c0302e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:11:18, skipping insertion in model container [2019-11-20 08:11:18,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:17" (2/3) ... [2019-11-20 08:11:18,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c0302e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:11:18, skipping insertion in model container [2019-11-20 08:11:18,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:11:18" (3/3) ... [2019-11-20 08:11:18,761 INFO L109 eAbstractionObserver]: Analyzing ICFG tree_cnstr.i [2019-11-20 08:11:18,770 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 08:11:18,776 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 56 error locations. [2019-11-20 08:11:18,786 INFO L249 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2019-11-20 08:11:18,802 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 08:11:18,802 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-20 08:11:18,802 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 08:11:18,802 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 08:11:18,802 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 08:11:18,802 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 08:11:18,802 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 08:11:18,803 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 08:11:18,820 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states. [2019-11-20 08:11:18,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-20 08:11:18,829 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:18,830 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:11:18,830 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr55ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-20 08:11:18,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:18,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1099820631, now seen corresponding path program 1 times [2019-11-20 08:11:18,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:11:18,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [126106830] [2019-11-20 08:11:18,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:19,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 08:11:19,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:11:19,118 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 08:11:19,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:19,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:19,127 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:19,127 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 08:11:19,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:19,138 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:11:19,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:19,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [126106830] [2019-11-20 08:11:19,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:11:19,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 08:11:19,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719309735] [2019-11-20 08:11:19,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:11:19,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:11:19,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:11:19,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:11:19,170 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 3 states. [2019-11-20 08:11:19,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:19,550 INFO L93 Difference]: Finished difference Result 163 states and 180 transitions. [2019-11-20 08:11:19,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:11:19,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-20 08:11:19,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:11:19,568 INFO L225 Difference]: With dead ends: 163 [2019-11-20 08:11:19,568 INFO L226 Difference]: Without dead ends: 159 [2019-11-20 08:11:19,570 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:11:19,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-20 08:11:19,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 116. [2019-11-20 08:11:19,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-20 08:11:19,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2019-11-20 08:11:19,646 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 7 [2019-11-20 08:11:19,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:11:19,647 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2019-11-20 08:11:19,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:11:19,647 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2019-11-20 08:11:19,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-20 08:11:19,648 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:19,648 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:11:19,849 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:19,857 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr55ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-20 08:11:19,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:19,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1099820632, now seen corresponding path program 1 times [2019-11-20 08:11:19,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:11:19,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1226304900] [2019-11-20 08:11:19,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:20,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:20,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 08:11:20,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:11:20,049 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 08:11:20,050 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:20,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:20,060 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:20,060 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 08:11:20,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:20,076 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:11:20,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:20,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1226304900] [2019-11-20 08:11:20,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:11:20,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 08:11:20,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018722590] [2019-11-20 08:11:20,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 08:11:20,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:11:20,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 08:11:20,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 08:11:20,121 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand 4 states. [2019-11-20 08:11:20,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:20,555 INFO L93 Difference]: Finished difference Result 157 states and 173 transitions. [2019-11-20 08:11:20,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:11:20,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-20 08:11:20,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:11:20,559 INFO L225 Difference]: With dead ends: 157 [2019-11-20 08:11:20,559 INFO L226 Difference]: Without dead ends: 157 [2019-11-20 08:11:20,560 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 08:11:20,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-20 08:11:20,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 114. [2019-11-20 08:11:20,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-20 08:11:20,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions. [2019-11-20 08:11:20,569 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 125 transitions. Word has length 7 [2019-11-20 08:11:20,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:11:20,570 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 125 transitions. [2019-11-20 08:11:20,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 08:11:20,570 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2019-11-20 08:11:20,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 08:11:20,571 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:20,571 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:11:20,773 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:20,774 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr55ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-20 08:11:20,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:20,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1549100580, now seen corresponding path program 1 times [2019-11-20 08:11:20,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:11:20,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [684943086] [2019-11-20 08:11:20,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:20,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 08:11:20,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:11:20,969 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 08:11:20,970 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:20,972 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:20,973 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:20,973 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 08:11:20,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:20,986 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:11:21,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:21,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [684943086] [2019-11-20 08:11:21,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:11:21,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 08:11:21,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47814976] [2019-11-20 08:11:21,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 08:11:21,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:11:21,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 08:11:21,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 08:11:21,008 INFO L87 Difference]: Start difference. First operand 114 states and 125 transitions. Second operand 4 states. [2019-11-20 08:11:21,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:21,459 INFO L93 Difference]: Finished difference Result 142 states and 159 transitions. [2019-11-20 08:11:21,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 08:11:21,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-20 08:11:21,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:11:21,461 INFO L225 Difference]: With dead ends: 142 [2019-11-20 08:11:21,461 INFO L226 Difference]: Without dead ends: 142 [2019-11-20 08:11:21,462 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 08:11:21,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-20 08:11:21,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 101. [2019-11-20 08:11:21,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-20 08:11:21,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2019-11-20 08:11:21,476 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 10 [2019-11-20 08:11:21,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:11:21,476 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2019-11-20 08:11:21,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 08:11:21,477 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2019-11-20 08:11:21,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 08:11:21,477 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:21,477 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:11:21,688 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:21,689 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr55ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-20 08:11:21,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:21,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1549100579, now seen corresponding path program 1 times [2019-11-20 08:11:21,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:11:21,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1077381290] [2019-11-20 08:11:21,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:21,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 08:11:21,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:11:21,880 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 08:11:21,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:21,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:21,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:21,891 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 08:11:21,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:21,918 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:11:21,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:21,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1077381290] [2019-11-20 08:11:21,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:11:21,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-20 08:11:21,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342516807] [2019-11-20 08:11:21,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 08:11:21,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:11:21,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 08:11:21,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 08:11:21,988 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand 6 states. [2019-11-20 08:11:22,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:22,949 INFO L93 Difference]: Finished difference Result 214 states and 242 transitions. [2019-11-20 08:11:22,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 08:11:22,950 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-20 08:11:22,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:11:22,951 INFO L225 Difference]: With dead ends: 214 [2019-11-20 08:11:22,952 INFO L226 Difference]: Without dead ends: 214 [2019-11-20 08:11:22,952 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-20 08:11:22,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-11-20 08:11:22,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 155. [2019-11-20 08:11:22,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-20 08:11:22,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 208 transitions. [2019-11-20 08:11:22,966 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 208 transitions. Word has length 10 [2019-11-20 08:11:22,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:11:22,966 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 208 transitions. [2019-11-20 08:11:22,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 08:11:22,967 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 208 transitions. [2019-11-20 08:11:22,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 08:11:22,967 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:22,968 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:11:23,170 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:23,170 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr55ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-20 08:11:23,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:23,171 INFO L82 PathProgramCache]: Analyzing trace with hash 169178440, now seen corresponding path program 1 times [2019-11-20 08:11:23,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:11:23,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [120992017] [2019-11-20 08:11:23,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:23,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 08:11:23,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:11:23,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:23,308 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:11:23,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:23,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [120992017] [2019-11-20 08:11:23,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:11:23,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 08:11:23,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448499981] [2019-11-20 08:11:23,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:11:23,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:11:23,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:11:23,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:11:23,315 INFO L87 Difference]: Start difference. First operand 155 states and 208 transitions. Second operand 3 states. [2019-11-20 08:11:23,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:23,334 INFO L93 Difference]: Finished difference Result 167 states and 206 transitions. [2019-11-20 08:11:23,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:11:23,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-20 08:11:23,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:11:23,335 INFO L225 Difference]: With dead ends: 167 [2019-11-20 08:11:23,335 INFO L226 Difference]: Without dead ends: 167 [2019-11-20 08:11:23,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:11:23,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-11-20 08:11:23,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 155. [2019-11-20 08:11:23,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-20 08:11:23,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 206 transitions. [2019-11-20 08:11:23,346 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 206 transitions. Word has length 13 [2019-11-20 08:11:23,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:11:23,346 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 206 transitions. [2019-11-20 08:11:23,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:11:23,346 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 206 transitions. [2019-11-20 08:11:23,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 08:11:23,349 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:23,349 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:11:23,551 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:23,551 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr55ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-20 08:11:23,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:23,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1557846871, now seen corresponding path program 1 times [2019-11-20 08:11:23,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:11:23,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1989089020] [2019-11-20 08:11:23,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:23,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 08:11:23,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:11:23,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:23,700 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:11:23,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:23,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1989089020] [2019-11-20 08:11:23,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:11:23,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 08:11:23,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839661802] [2019-11-20 08:11:23,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:11:23,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:11:23,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:11:23,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:11:23,708 INFO L87 Difference]: Start difference. First operand 155 states and 206 transitions. Second operand 3 states. [2019-11-20 08:11:23,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:23,718 INFO L93 Difference]: Finished difference Result 158 states and 209 transitions. [2019-11-20 08:11:23,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:11:23,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-20 08:11:23,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:11:23,719 INFO L225 Difference]: With dead ends: 158 [2019-11-20 08:11:23,719 INFO L226 Difference]: Without dead ends: 158 [2019-11-20 08:11:23,720 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:11:23,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-20 08:11:23,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2019-11-20 08:11:23,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-20 08:11:23,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 209 transitions. [2019-11-20 08:11:23,727 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 209 transitions. Word has length 17 [2019-11-20 08:11:23,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:11:23,727 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 209 transitions. [2019-11-20 08:11:23,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:11:23,728 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 209 transitions. [2019-11-20 08:11:23,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 08:11:23,729 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:23,729 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:11:23,937 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:23,937 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr55ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-20 08:11:23,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:23,937 INFO L82 PathProgramCache]: Analyzing trace with hash -380964589, now seen corresponding path program 1 times [2019-11-20 08:11:23,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:11:23,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1796303504] [2019-11-20 08:11:23,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:24,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 08:11:24,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:11:24,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:24,070 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:11:24,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:24,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1796303504] [2019-11-20 08:11:24,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:11:24,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 08:11:24,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381650856] [2019-11-20 08:11:24,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:11:24,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:11:24,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:11:24,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:11:24,078 INFO L87 Difference]: Start difference. First operand 158 states and 209 transitions. Second operand 3 states. [2019-11-20 08:11:24,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:24,088 INFO L93 Difference]: Finished difference Result 160 states and 211 transitions. [2019-11-20 08:11:24,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:11:24,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-20 08:11:24,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:11:24,091 INFO L225 Difference]: With dead ends: 160 [2019-11-20 08:11:24,091 INFO L226 Difference]: Without dead ends: 160 [2019-11-20 08:11:24,091 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:11:24,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-20 08:11:24,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-11-20 08:11:24,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-20 08:11:24,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 211 transitions. [2019-11-20 08:11:24,098 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 211 transitions. Word has length 17 [2019-11-20 08:11:24,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:11:24,098 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 211 transitions. [2019-11-20 08:11:24,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:11:24,098 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 211 transitions. [2019-11-20 08:11:24,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 08:11:24,100 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:24,100 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:11:24,302 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:24,303 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr55ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-20 08:11:24,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:24,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1032177949, now seen corresponding path program 1 times [2019-11-20 08:11:24,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:11:24,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1199019680] [2019-11-20 08:11:24,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:24,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 08:11:24,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:11:24,521 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:24,522 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 30 [2019-11-20 08:11:24,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:24,551 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-20 08:11:24,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:11:24,551 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-20 08:11:24,575 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 08:11:24,575 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:24,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:24,585 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:24,586 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:9 [2019-11-20 08:11:24,603 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-20 08:11:24,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:24,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:24,607 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:24,607 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2019-11-20 08:11:24,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:24,632 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:11:24,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:24,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1199019680] [2019-11-20 08:11:24,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:11:24,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 5 [2019-11-20 08:11:24,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120038384] [2019-11-20 08:11:24,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 08:11:24,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:11:24,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 08:11:24,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-20 08:11:24,642 INFO L87 Difference]: Start difference. First operand 160 states and 211 transitions. Second operand 6 states. [2019-11-20 08:11:25,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:25,394 INFO L93 Difference]: Finished difference Result 271 states and 352 transitions. [2019-11-20 08:11:25,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 08:11:25,395 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-20 08:11:25,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:11:25,396 INFO L225 Difference]: With dead ends: 271 [2019-11-20 08:11:25,397 INFO L226 Difference]: Without dead ends: 271 [2019-11-20 08:11:25,397 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-20 08:11:25,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-20 08:11:25,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 159. [2019-11-20 08:11:25,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-11-20 08:11:25,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 209 transitions. [2019-11-20 08:11:25,403 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 209 transitions. Word has length 18 [2019-11-20 08:11:25,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:11:25,404 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 209 transitions. [2019-11-20 08:11:25,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 08:11:25,404 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 209 transitions. [2019-11-20 08:11:25,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 08:11:25,405 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:25,405 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:11:25,605 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:25,606 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr55ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-20 08:11:25,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:25,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1032177950, now seen corresponding path program 1 times [2019-11-20 08:11:25,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:11:25,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2049123687] [2019-11-20 08:11:25,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:25,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 08:11:25,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:11:25,793 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 08:11:25,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:25,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:25,798 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:25,798 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 08:11:25,816 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 08:11:25,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:25,825 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:25,829 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 08:11:25,829 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:25,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:25,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:25,837 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2019-11-20 08:11:25,856 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-20 08:11:25,857 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:25,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:25,874 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 08:11:25,875 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:25,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:25,879 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:25,879 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2019-11-20 08:11:25,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:25,889 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:11:26,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:26,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2049123687] [2019-11-20 08:11:26,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:11:26,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-20 08:11:26,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409026374] [2019-11-20 08:11:26,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 08:11:26,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:11:26,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 08:11:26,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-20 08:11:26,017 INFO L87 Difference]: Start difference. First operand 159 states and 209 transitions. Second operand 8 states. [2019-11-20 08:11:27,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:27,296 INFO L93 Difference]: Finished difference Result 291 states and 387 transitions. [2019-11-20 08:11:27,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 08:11:27,297 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-11-20 08:11:27,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:11:27,298 INFO L225 Difference]: With dead ends: 291 [2019-11-20 08:11:27,298 INFO L226 Difference]: Without dead ends: 291 [2019-11-20 08:11:27,299 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-20 08:11:27,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-20 08:11:27,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 158. [2019-11-20 08:11:27,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-20 08:11:27,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 207 transitions. [2019-11-20 08:11:27,304 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 207 transitions. Word has length 18 [2019-11-20 08:11:27,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:11:27,305 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 207 transitions. [2019-11-20 08:11:27,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 08:11:27,305 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 207 transitions. [2019-11-20 08:11:27,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 08:11:27,306 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:27,306 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:11:27,508 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:27,509 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr55ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-20 08:11:27,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:27,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1802833934, now seen corresponding path program 1 times [2019-11-20 08:11:27,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:11:27,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [179765020] [2019-11-20 08:11:27,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:27,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 08:11:27,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:11:27,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:27,646 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:11:27,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:27,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [179765020] [2019-11-20 08:11:27,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:11:27,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 08:11:27,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906441240] [2019-11-20 08:11:27,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:11:27,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:11:27,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:11:27,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:11:27,654 INFO L87 Difference]: Start difference. First operand 158 states and 207 transitions. Second operand 3 states. [2019-11-20 08:11:27,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:27,704 INFO L93 Difference]: Finished difference Result 173 states and 216 transitions. [2019-11-20 08:11:27,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:11:27,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-20 08:11:27,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:11:27,706 INFO L225 Difference]: With dead ends: 173 [2019-11-20 08:11:27,706 INFO L226 Difference]: Without dead ends: 173 [2019-11-20 08:11:27,707 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:11:27,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-20 08:11:27,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 160. [2019-11-20 08:11:27,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-20 08:11:27,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 206 transitions. [2019-11-20 08:11:27,712 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 206 transitions. Word has length 19 [2019-11-20 08:11:27,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:11:27,713 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 206 transitions. [2019-11-20 08:11:27,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:11:27,713 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 206 transitions. [2019-11-20 08:11:27,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 08:11:27,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:27,714 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:11:27,918 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:27,918 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr55ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-20 08:11:27,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:27,919 INFO L82 PathProgramCache]: Analyzing trace with hash -98027946, now seen corresponding path program 1 times [2019-11-20 08:11:27,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:11:27,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1986642018] [2019-11-20 08:11:27,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:28,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 08:11:28,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:11:28,116 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 08:11:28,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:28,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:28,131 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 08:11:28,131 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:28,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:28,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:28,139 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-11-20 08:11:28,173 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 08:11:28,174 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:28,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:28,183 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 08:11:28,183 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:28,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:28,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:28,188 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-11-20 08:11:28,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:28,214 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:11:28,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:11:28,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:28,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1986642018] [2019-11-20 08:11:28,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:11:28,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 9 [2019-11-20 08:11:28,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808917233] [2019-11-20 08:11:28,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 08:11:28,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:11:28,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 08:11:28,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-20 08:11:28,292 INFO L87 Difference]: Start difference. First operand 160 states and 206 transitions. Second operand 9 states. [2019-11-20 08:11:29,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:29,028 INFO L93 Difference]: Finished difference Result 244 states and 303 transitions. [2019-11-20 08:11:29,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 08:11:29,028 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-11-20 08:11:29,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:11:29,030 INFO L225 Difference]: With dead ends: 244 [2019-11-20 08:11:29,030 INFO L226 Difference]: Without dead ends: 244 [2019-11-20 08:11:29,030 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-11-20 08:11:29,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-11-20 08:11:29,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 178. [2019-11-20 08:11:29,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-11-20 08:11:29,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 230 transitions. [2019-11-20 08:11:29,035 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 230 transitions. Word has length 19 [2019-11-20 08:11:29,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:11:29,035 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 230 transitions. [2019-11-20 08:11:29,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 08:11:29,035 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 230 transitions. [2019-11-20 08:11:29,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 08:11:29,036 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:29,036 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:11:29,239 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:29,239 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr55ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-20 08:11:29,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:29,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1563750143, now seen corresponding path program 1 times [2019-11-20 08:11:29,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:11:29,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [986819204] [2019-11-20 08:11:29,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:29,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 08:11:29,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:11:29,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:11:29,453 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 08:11:29,454 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:29,457 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-11-20 08:11:29,457 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:29,470 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:29,474 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-11-20 08:11:29,475 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:29,477 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 12 treesize of output 8 [2019-11-20 08:11:29,477 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:29,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:29,482 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-20 08:11:29,482 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:9 [2019-11-20 08:11:29,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:29,493 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:11:29,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:11:29,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:29,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [986819204] [2019-11-20 08:11:29,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:11:29,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2019-11-20 08:11:29,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828006415] [2019-11-20 08:11:29,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 08:11:29,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:11:29,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 08:11:29,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-20 08:11:29,539 INFO L87 Difference]: Start difference. First operand 178 states and 230 transitions. Second operand 8 states. [2019-11-20 08:11:30,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:30,214 INFO L93 Difference]: Finished difference Result 188 states and 240 transitions. [2019-11-20 08:11:30,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 08:11:30,214 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-11-20 08:11:30,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:11:30,216 INFO L225 Difference]: With dead ends: 188 [2019-11-20 08:11:30,216 INFO L226 Difference]: Without dead ends: 188 [2019-11-20 08:11:30,216 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-11-20 08:11:30,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-20 08:11:30,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 181. [2019-11-20 08:11:30,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-11-20 08:11:30,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 233 transitions. [2019-11-20 08:11:30,221 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 233 transitions. Word has length 20 [2019-11-20 08:11:30,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:11:30,222 INFO L462 AbstractCegarLoop]: Abstraction has 181 states and 233 transitions. [2019-11-20 08:11:30,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 08:11:30,222 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 233 transitions. [2019-11-20 08:11:30,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 08:11:30,224 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:30,225 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:11:30,427 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:30,428 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr55ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-20 08:11:30,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:30,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1563934841, now seen corresponding path program 1 times [2019-11-20 08:11:30,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:11:30,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1112828816] [2019-11-20 08:11:30,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:30,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-20 08:11:30,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:11:30,613 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 08:11:30,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:30,621 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:30,624 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 08:11:30,624 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:30,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:30,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:30,630 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-11-20 08:11:30,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 08:11:30,655 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-20 08:11:30,655 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:30,684 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:30,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 08:11:30,690 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-20 08:11:30,690 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:30,709 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:30,709 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:30,709 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2019-11-20 08:11:30,769 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 08:11:30,769 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:30,779 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:30,779 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:30,779 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:28 [2019-11-20 08:11:30,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:30,808 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:11:30,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:30,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1112828816] [2019-11-20 08:11:30,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:11:30,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 5] imperfect sequences [] total 10 [2019-11-20 08:11:30,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142965310] [2019-11-20 08:11:30,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 08:11:30,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:11:30,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 08:11:30,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-20 08:11:30,890 INFO L87 Difference]: Start difference. First operand 181 states and 233 transitions. Second operand 10 states. [2019-11-20 08:11:32,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:32,020 INFO L93 Difference]: Finished difference Result 388 states and 470 transitions. [2019-11-20 08:11:32,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 08:11:32,021 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-20 08:11:32,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:11:32,023 INFO L225 Difference]: With dead ends: 388 [2019-11-20 08:11:32,023 INFO L226 Difference]: Without dead ends: 382 [2019-11-20 08:11:32,024 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-11-20 08:11:32,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-11-20 08:11:32,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 265. [2019-11-20 08:11:32,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-11-20 08:11:32,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 360 transitions. [2019-11-20 08:11:32,032 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 360 transitions. Word has length 20 [2019-11-20 08:11:32,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:11:32,033 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 360 transitions. [2019-11-20 08:11:32,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 08:11:32,033 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 360 transitions. [2019-11-20 08:11:32,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 08:11:32,034 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:32,034 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:11:32,237 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:32,237 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr55ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-20 08:11:32,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:32,238 INFO L82 PathProgramCache]: Analyzing trace with hash -53260016, now seen corresponding path program 1 times [2019-11-20 08:11:32,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:11:32,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2058788943] [2019-11-20 08:11:32,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:32,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 08:11:32,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:11:32,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:32,427 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:11:32,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:32,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2058788943] [2019-11-20 08:11:32,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:11:32,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [] total 6 [2019-11-20 08:11:32,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480496573] [2019-11-20 08:11:32,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 08:11:32,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:11:32,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 08:11:32,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-20 08:11:32,468 INFO L87 Difference]: Start difference. First operand 265 states and 360 transitions. Second operand 7 states. [2019-11-20 08:11:32,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:32,727 INFO L93 Difference]: Finished difference Result 307 states and 399 transitions. [2019-11-20 08:11:32,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 08:11:32,728 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-11-20 08:11:32,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:11:32,730 INFO L225 Difference]: With dead ends: 307 [2019-11-20 08:11:32,730 INFO L226 Difference]: Without dead ends: 307 [2019-11-20 08:11:32,730 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 08:11:32,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-11-20 08:11:32,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 267. [2019-11-20 08:11:32,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-11-20 08:11:32,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 363 transitions. [2019-11-20 08:11:32,738 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 363 transitions. Word has length 20 [2019-11-20 08:11:32,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:11:32,738 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 363 transitions. [2019-11-20 08:11:32,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 08:11:32,739 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 363 transitions. [2019-11-20 08:11:32,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 08:11:32,739 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:32,739 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:11:32,942 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:32,942 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr55ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-20 08:11:32,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:32,943 INFO L82 PathProgramCache]: Analyzing trace with hash 348664735, now seen corresponding path program 1 times [2019-11-20 08:11:32,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:11:32,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [177388252] [2019-11-20 08:11:32,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:33,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 08:11:33,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:11:33,128 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:33,128 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 30 [2019-11-20 08:11:33,129 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:33,142 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-20 08:11:33,143 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:11:33,143 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-20 08:11:33,159 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 08:11:33,159 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:33,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:33,166 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:33,166 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-11-20 08:11:33,185 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 21 treesize of output 9 [2019-11-20 08:11:33,186 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:33,188 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:33,188 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:33,188 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:7 [2019-11-20 08:11:33,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:33,196 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:11:33,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:33,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [177388252] [2019-11-20 08:11:33,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:11:33,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 5 [2019-11-20 08:11:33,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020494702] [2019-11-20 08:11:33,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 08:11:33,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:11:33,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 08:11:33,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-20 08:11:33,208 INFO L87 Difference]: Start difference. First operand 267 states and 363 transitions. Second operand 6 states. [2019-11-20 08:11:33,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:33,836 INFO L93 Difference]: Finished difference Result 356 states and 474 transitions. [2019-11-20 08:11:33,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 08:11:33,837 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-20 08:11:33,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:11:33,839 INFO L225 Difference]: With dead ends: 356 [2019-11-20 08:11:33,839 INFO L226 Difference]: Without dead ends: 356 [2019-11-20 08:11:33,840 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-20 08:11:33,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-11-20 08:11:33,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 266. [2019-11-20 08:11:33,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-20 08:11:33,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 360 transitions. [2019-11-20 08:11:33,853 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 360 transitions. Word has length 20 [2019-11-20 08:11:33,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:11:33,853 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 360 transitions. [2019-11-20 08:11:33,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 08:11:33,853 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 360 transitions. [2019-11-20 08:11:33,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 08:11:33,856 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:33,857 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:11:34,060 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:34,060 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr55ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-20 08:11:34,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:34,061 INFO L82 PathProgramCache]: Analyzing trace with hash 348664736, now seen corresponding path program 1 times [2019-11-20 08:11:34,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:11:34,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2004284883] [2019-11-20 08:11:34,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:34,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 08:11:34,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:11:34,238 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 08:11:34,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:34,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:34,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:34,244 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 08:11:34,262 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 08:11:34,262 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:34,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:34,278 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 08:11:34,279 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:34,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:34,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:34,289 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2019-11-20 08:11:34,313 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 21 treesize of output 9 [2019-11-20 08:11:34,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:34,323 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:34,333 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-20 08:11:34,334 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:34,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:34,338 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:34,338 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:9 [2019-11-20 08:11:34,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:34,364 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:11:34,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:34,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2004284883] [2019-11-20 08:11:34,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:11:34,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-20 08:11:34,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884549279] [2019-11-20 08:11:34,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 08:11:34,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:11:34,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 08:11:34,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-20 08:11:34,476 INFO L87 Difference]: Start difference. First operand 266 states and 360 transitions. Second operand 8 states. [2019-11-20 08:11:35,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:35,400 INFO L93 Difference]: Finished difference Result 389 states and 530 transitions. [2019-11-20 08:11:35,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 08:11:35,401 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-11-20 08:11:35,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:11:35,403 INFO L225 Difference]: With dead ends: 389 [2019-11-20 08:11:35,404 INFO L226 Difference]: Without dead ends: 389 [2019-11-20 08:11:35,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-20 08:11:35,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-11-20 08:11:35,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 265. [2019-11-20 08:11:35,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-11-20 08:11:35,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 357 transitions. [2019-11-20 08:11:35,412 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 357 transitions. Word has length 20 [2019-11-20 08:11:35,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:11:35,412 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 357 transitions. [2019-11-20 08:11:35,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 08:11:35,412 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 357 transitions. [2019-11-20 08:11:35,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 08:11:35,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:35,413 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] [2019-11-20 08:11:35,613 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:35,613 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr55ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-20 08:11:35,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:35,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1942455287, now seen corresponding path program 1 times [2019-11-20 08:11:35,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:11:35,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [254516313] [2019-11-20 08:11:35,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:35,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:35,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 08:11:35,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:11:35,816 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 08:11:35,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:35,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:35,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:35,818 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 08:11:35,856 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:35,857 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-20 08:11:35,857 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:35,883 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-20 08:11:35,884 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:35,884 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2019-11-20 08:11:35,907 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 08:11:35,908 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:35,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:35,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:35,927 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:25 [2019-11-20 08:11:36,013 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:36,013 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 51 [2019-11-20 08:11:36,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:11:36,015 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:36,046 INFO L567 ElimStorePlain]: treesize reduction 20, result has 64.3 percent of original size [2019-11-20 08:11:36,046 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:11:36,047 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2019-11-20 08:11:36,111 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:36,112 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-11-20 08:11:36,112 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:36,133 INFO L567 ElimStorePlain]: treesize reduction 12, result has 61.3 percent of original size [2019-11-20 08:11:36,133 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:11:36,133 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:19 [2019-11-20 08:11:36,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:36,151 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:11:36,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:36,255 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:36,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:11:36,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:11:36,256 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-20 08:11:36,257 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:44 [2019-11-20 08:11:36,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:36,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [254516313] [2019-11-20 08:11:36,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:11:36,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-11-20 08:11:36,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765110687] [2019-11-20 08:11:36,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 08:11:36,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:11:36,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 08:11:36,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2019-11-20 08:11:36,327 INFO L87 Difference]: Start difference. First operand 265 states and 357 transitions. Second operand 16 states. [2019-11-20 08:11:37,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:37,307 INFO L93 Difference]: Finished difference Result 374 states and 496 transitions. [2019-11-20 08:11:37,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 08:11:37,308 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-11-20 08:11:37,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:11:37,310 INFO L225 Difference]: With dead ends: 374 [2019-11-20 08:11:37,310 INFO L226 Difference]: Without dead ends: 374 [2019-11-20 08:11:37,310 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=201, Invalid=501, Unknown=0, NotChecked=0, Total=702 [2019-11-20 08:11:37,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-11-20 08:11:37,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 264. [2019-11-20 08:11:37,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-11-20 08:11:37,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 354 transitions. [2019-11-20 08:11:37,318 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 354 transitions. Word has length 21 [2019-11-20 08:11:37,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:11:37,318 INFO L462 AbstractCegarLoop]: Abstraction has 264 states and 354 transitions. [2019-11-20 08:11:37,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 08:11:37,318 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 354 transitions. [2019-11-20 08:11:37,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 08:11:37,319 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:37,319 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] [2019-11-20 08:11:37,522 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:37,522 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr55ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-20 08:11:37,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:37,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1942455288, now seen corresponding path program 1 times [2019-11-20 08:11:37,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:11:37,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1742326498] [2019-11-20 08:11:37,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:37,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 08:11:37,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:11:37,777 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 08:11:37,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:37,779 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:37,779 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:37,779 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 08:11:37,790 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_75|], 1=[|v_#valid_138|]} [2019-11-20 08:11:37,793 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 08:11:37,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:37,806 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:37,812 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:37,813 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-20 08:11:37,813 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:37,822 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:37,822 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:37,823 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-11-20 08:11:37,843 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 08:11:37,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:37,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:37,861 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 08:11:37,861 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:37,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:37,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:37,877 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2019-11-20 08:11:37,934 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2019-11-20 08:11:37,934 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:37,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:37,998 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:37,998 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 58 [2019-11-20 08:11:37,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:11:37,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:11:38,000 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-20 08:11:38,038 INFO L567 ElimStorePlain]: treesize reduction 92, result has 34.3 percent of original size [2019-11-20 08:11:38,039 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:11:38,039 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:47 [2019-11-20 08:11:38,079 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:38,079 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 38 [2019-11-20 08:11:38,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:38,104 INFO L567 ElimStorePlain]: treesize reduction 12, result has 72.1 percent of original size [2019-11-20 08:11:38,107 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 22 treesize of output 10 [2019-11-20 08:11:38,107 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:38,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:38,114 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:38,115 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2019-11-20 08:11:38,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:38,144 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:11:38,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:39,245 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-11-20 08:11:39,246 INFO L567 ElimStorePlain]: treesize reduction 10, result has 93.3 percent of original size [2019-11-20 08:11:39,253 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:39,379 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-20 08:11:39,380 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:39,391 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:39,613 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-11-20 08:11:39,614 INFO L567 ElimStorePlain]: treesize reduction 48, result has 69.0 percent of original size [2019-11-20 08:11:39,619 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:39,769 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-11-20 08:11:39,769 INFO L567 ElimStorePlain]: treesize reduction 10, result has 85.5 percent of original size [2019-11-20 08:11:39,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:11:39,770 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-11-20 08:11:39,771 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:160, output treesize:34 [2019-11-20 08:11:39,886 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-11-20 08:11:39,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:39,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:39,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:39,891 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2019-11-20 08:11:39,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:39,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1742326498] [2019-11-20 08:11:39,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:11:39,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-11-20 08:11:39,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144380958] [2019-11-20 08:11:39,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 08:11:39,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:11:39,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 08:11:39,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-11-20 08:11:39,949 INFO L87 Difference]: Start difference. First operand 264 states and 354 transitions. Second operand 16 states. [2019-11-20 08:11:41,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:41,919 INFO L93 Difference]: Finished difference Result 373 states and 493 transitions. [2019-11-20 08:11:41,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 08:11:41,920 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-11-20 08:11:41,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:11:41,921 INFO L225 Difference]: With dead ends: 373 [2019-11-20 08:11:41,921 INFO L226 Difference]: Without dead ends: 373 [2019-11-20 08:11:41,922 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=193, Invalid=509, Unknown=0, NotChecked=0, Total=702 [2019-11-20 08:11:41,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-11-20 08:11:41,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 263. [2019-11-20 08:11:41,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-11-20 08:11:41,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 351 transitions. [2019-11-20 08:11:41,927 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 351 transitions. Word has length 21 [2019-11-20 08:11:41,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:11:41,927 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 351 transitions. [2019-11-20 08:11:41,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 08:11:41,928 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 351 transitions. [2019-11-20 08:11:41,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 08:11:41,928 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:41,928 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:11:42,128 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:42,129 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr55ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-20 08:11:42,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:42,129 INFO L82 PathProgramCache]: Analyzing trace with hash 377025158, now seen corresponding path program 1 times [2019-11-20 08:11:42,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:11:42,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1997451202] [2019-11-20 08:11:42,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:42,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 08:11:42,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:11:42,316 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 08:11:42,316 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:42,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:42,329 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 08:11:42,329 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:42,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:42,336 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:42,337 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-11-20 08:11:42,361 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 08:11:42,362 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2019-11-20 08:11:42,362 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:42,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:42,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:42,370 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:23 [2019-11-20 08:11:42,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:42,414 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:11:42,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:11:42,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:42,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1997451202] [2019-11-20 08:11:42,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:11:42,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2019-11-20 08:11:42,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008126738] [2019-11-20 08:11:42,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 08:11:42,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:11:42,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 08:11:42,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-20 08:11:42,483 INFO L87 Difference]: Start difference. First operand 263 states and 351 transitions. Second operand 11 states. [2019-11-20 08:11:43,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:43,237 INFO L93 Difference]: Finished difference Result 333 states and 428 transitions. [2019-11-20 08:11:43,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 08:11:43,238 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-11-20 08:11:43,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:11:43,239 INFO L225 Difference]: With dead ends: 333 [2019-11-20 08:11:43,239 INFO L226 Difference]: Without dead ends: 333 [2019-11-20 08:11:43,240 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-11-20 08:11:43,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-11-20 08:11:43,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 301. [2019-11-20 08:11:43,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-11-20 08:11:43,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 408 transitions. [2019-11-20 08:11:43,246 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 408 transitions. Word has length 22 [2019-11-20 08:11:43,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:11:43,246 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 408 transitions. [2019-11-20 08:11:43,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 08:11:43,246 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 408 transitions. [2019-11-20 08:11:43,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 08:11:43,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:43,247 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:11:43,449 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:43,450 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr55ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-20 08:11:43,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:43,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1825980261, now seen corresponding path program 1 times [2019-11-20 08:11:43,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:11:43,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1286560021] [2019-11-20 08:11:43,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:43,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 08:11:43,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:11:43,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:43,579 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:11:43,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:43,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1286560021] [2019-11-20 08:11:43,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:11:43,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 08:11:43,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247586160] [2019-11-20 08:11:43,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:11:43,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:11:43,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:11:43,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:11:43,593 INFO L87 Difference]: Start difference. First operand 301 states and 408 transitions. Second operand 3 states. [2019-11-20 08:11:43,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:43,605 INFO L93 Difference]: Finished difference Result 275 states and 358 transitions. [2019-11-20 08:11:43,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:11:43,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-20 08:11:43,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:11:43,607 INFO L225 Difference]: With dead ends: 275 [2019-11-20 08:11:43,607 INFO L226 Difference]: Without dead ends: 275 [2019-11-20 08:11:43,607 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-20 08:11:43,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-11-20 08:11:43,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 273. [2019-11-20 08:11:43,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-11-20 08:11:43,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 358 transitions. [2019-11-20 08:11:43,611 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 358 transitions. Word has length 23 [2019-11-20 08:11:43,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:11:43,612 INFO L462 AbstractCegarLoop]: Abstraction has 273 states and 358 transitions. [2019-11-20 08:11:43,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:11:43,612 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 358 transitions. [2019-11-20 08:11:43,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 08:11:43,612 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:43,613 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-20 08:11:43,816 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:43,816 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr55ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-20 08:11:43,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:43,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1840273167, now seen corresponding path program 1 times [2019-11-20 08:11:43,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:11:43,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [837060754] [2019-11-20 08:11:43,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:44,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 08:11:44,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:11:44,015 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 08:11:44,015 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:44,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:44,016 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:44,017 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 08:11:44,043 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:44,043 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-20 08:11:44,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:44,059 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-20 08:11:44,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:44,060 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2019-11-20 08:11:44,081 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 08:11:44,082 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:44,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:44,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:44,101 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2019-11-20 08:11:44,170 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:44,170 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 59 [2019-11-20 08:11:44,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:11:44,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:11:44,172 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-20 08:11:44,212 INFO L567 ElimStorePlain]: treesize reduction 86, result has 33.3 percent of original size [2019-11-20 08:11:44,213 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:11:44,213 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:42 [2019-11-20 08:11:44,257 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:44,257 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 33 [2019-11-20 08:11:44,258 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:44,278 INFO L567 ElimStorePlain]: treesize reduction 14, result has 57.6 percent of original size [2019-11-20 08:11:44,278 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:11:44,278 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:19 [2019-11-20 08:11:44,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:44,296 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:11:44,399 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:44,421 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:44,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:11:44,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:11:44,422 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-20 08:11:44,422 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:44 [2019-11-20 08:11:44,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:44,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [837060754] [2019-11-20 08:11:44,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:11:44,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-11-20 08:11:44,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708919884] [2019-11-20 08:11:44,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 08:11:44,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:11:44,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 08:11:44,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2019-11-20 08:11:44,516 INFO L87 Difference]: Start difference. First operand 273 states and 358 transitions. Second operand 16 states. [2019-11-20 08:11:45,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:45,557 INFO L93 Difference]: Finished difference Result 385 states and 514 transitions. [2019-11-20 08:11:45,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 08:11:45,557 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2019-11-20 08:11:45,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:11:45,559 INFO L225 Difference]: With dead ends: 385 [2019-11-20 08:11:45,559 INFO L226 Difference]: Without dead ends: 385 [2019-11-20 08:11:45,560 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=201, Invalid=501, Unknown=0, NotChecked=0, Total=702 [2019-11-20 08:11:45,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-11-20 08:11:45,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 272. [2019-11-20 08:11:45,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-11-20 08:11:45,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 356 transitions. [2019-11-20 08:11:45,566 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 356 transitions. Word has length 23 [2019-11-20 08:11:45,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:11:45,566 INFO L462 AbstractCegarLoop]: Abstraction has 272 states and 356 transitions. [2019-11-20 08:11:45,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 08:11:45,566 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 356 transitions. [2019-11-20 08:11:45,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 08:11:45,567 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:45,567 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-20 08:11:45,770 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:45,770 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr55ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-20 08:11:45,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:45,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1840273168, now seen corresponding path program 1 times [2019-11-20 08:11:45,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:11:45,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1366783434] [2019-11-20 08:11:45,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:45,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 08:11:45,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:11:45,976 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 08:11:45,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:45,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:45,977 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:45,978 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 08:11:45,986 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_79|], 1=[|v_#valid_158|]} [2019-11-20 08:11:45,988 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 08:11:45,988 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:45,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:46,007 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:46,007 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-20 08:11:46,008 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:46,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:46,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:46,014 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-11-20 08:11:46,031 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 08:11:46,032 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:46,045 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:46,048 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 08:11:46,049 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:46,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:46,060 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:46,060 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:31 [2019-11-20 08:11:46,131 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:46,132 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 70 [2019-11-20 08:11:46,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:11:46,133 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:46,170 INFO L567 ElimStorePlain]: treesize reduction 26, result has 72.0 percent of original size [2019-11-20 08:11:46,174 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2019-11-20 08:11:46,174 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:46,188 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:46,188 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:11:46,189 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:77, output treesize:57 [2019-11-20 08:11:46,237 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:46,238 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 40 [2019-11-20 08:11:46,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:46,267 INFO L567 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-11-20 08:11:46,269 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 26 treesize of output 10 [2019-11-20 08:11:46,270 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:46,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:46,283 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:46,283 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:75, output treesize:9 [2019-11-20 08:11:46,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:46,304 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:11:46,885 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-20 08:11:47,481 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-20 08:11:47,514 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:47,826 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-11-20 08:11:47,826 INFO L567 ElimStorePlain]: treesize reduction 12, result has 91.7 percent of original size [2019-11-20 08:11:47,835 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:47,978 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 08:11:47,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:47,986 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:48,218 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-11-20 08:11:48,219 INFO L567 ElimStorePlain]: treesize reduction 12, result has 91.9 percent of original size [2019-11-20 08:11:48,231 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:48,429 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-11-20 08:11:48,429 INFO L567 ElimStorePlain]: treesize reduction 56, result has 54.5 percent of original size [2019-11-20 08:11:48,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:11:48,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:11:48,431 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: and 5 xjuncts. [2019-11-20 08:11:48,432 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:190, output treesize:54 [2019-11-20 08:11:48,595 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-11-20 08:11:48,602 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:48,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:48,608 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:48,608 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2019-11-20 08:11:48,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:48,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1366783434] [2019-11-20 08:11:48,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:11:48,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-11-20 08:11:48,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176205058] [2019-11-20 08:11:48,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 08:11:48,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:11:48,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 08:11:48,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-11-20 08:11:48,717 INFO L87 Difference]: Start difference. First operand 272 states and 356 transitions. Second operand 16 states. [2019-11-20 08:11:50,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:50,387 INFO L93 Difference]: Finished difference Result 384 states and 512 transitions. [2019-11-20 08:11:50,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 08:11:50,389 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2019-11-20 08:11:50,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:11:50,391 INFO L225 Difference]: With dead ends: 384 [2019-11-20 08:11:50,391 INFO L226 Difference]: Without dead ends: 384 [2019-11-20 08:11:50,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=193, Invalid=509, Unknown=0, NotChecked=0, Total=702 [2019-11-20 08:11:50,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-11-20 08:11:50,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 271. [2019-11-20 08:11:50,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-11-20 08:11:50,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 354 transitions. [2019-11-20 08:11:50,397 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 354 transitions. Word has length 23 [2019-11-20 08:11:50,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:11:50,397 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 354 transitions. [2019-11-20 08:11:50,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 08:11:50,398 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 354 transitions. [2019-11-20 08:11:50,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 08:11:50,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:50,398 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-20 08:11:50,602 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:50,602 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr55ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-20 08:11:50,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:50,603 INFO L82 PathProgramCache]: Analyzing trace with hash -770812853, now seen corresponding path program 1 times [2019-11-20 08:11:50,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:11:50,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [611782085] [2019-11-20 08:11:50,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:50,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 08:11:50,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:11:50,778 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 08:11:50,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:50,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:50,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:50,780 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 08:11:50,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:50,821 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:11:56,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:56,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [611782085] [2019-11-20 08:11:56,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:11:56,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-11-20 08:11:56,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964632471] [2019-11-20 08:11:56,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 08:11:56,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:11:56,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 08:11:56,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=65, Unknown=2, NotChecked=0, Total=90 [2019-11-20 08:11:56,912 INFO L87 Difference]: Start difference. First operand 271 states and 354 transitions. Second operand 10 states. [2019-11-20 08:11:57,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:57,768 INFO L93 Difference]: Finished difference Result 283 states and 366 transitions. [2019-11-20 08:11:57,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 08:11:57,769 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-11-20 08:11:57,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:11:57,771 INFO L225 Difference]: With dead ends: 283 [2019-11-20 08:11:57,771 INFO L226 Difference]: Without dead ends: 267 [2019-11-20 08:11:57,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=58, Invalid=150, Unknown=2, NotChecked=0, Total=210 [2019-11-20 08:11:57,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-11-20 08:11:57,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 266. [2019-11-20 08:11:57,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-20 08:11:57,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 348 transitions. [2019-11-20 08:11:57,778 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 348 transitions. Word has length 24 [2019-11-20 08:11:57,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:11:57,778 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 348 transitions. [2019-11-20 08:11:57,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 08:11:57,779 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 348 transitions. [2019-11-20 08:11:57,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 08:11:57,779 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:57,780 INFO L410 BasicCegarLoop]: trace histogram [2, 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-20 08:11:57,983 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:57,983 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr55ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-20 08:11:57,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:57,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1384127446, now seen corresponding path program 1 times [2019-11-20 08:11:57,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:11:57,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1455540309] [2019-11-20 08:11:57,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:11:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:58,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-20 08:11:58,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:11:58,338 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 08:11:58,338 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:58,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:58,344 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:58,344 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 08:11:58,358 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 08:11:58,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:58,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:58,368 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:58,368 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-11-20 08:11:58,561 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:58,561 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-20 08:11:58,562 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:58,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:58,577 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:58,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:37 [2019-11-20 08:11:58,605 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_83|], 6=[|v_#memory_$Pointer$.base_90|]} [2019-11-20 08:11:58,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 08:11:58,612 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-20 08:11:58,612 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:58,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:58,646 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 08:11:58,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 08:11:58,648 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 08:11:58,649 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2019-11-20 08:11:58,649 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:58,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:58,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:58,670 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:34 [2019-11-20 08:11:58,740 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_84|], 6=[|v_#memory_$Pointer$.base_91|]} [2019-11-20 08:11:58,745 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 08:11:58,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:58,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:58,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 08:11:58,827 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:58,828 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 95 [2019-11-20 08:11:58,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:11:58,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:11:58,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:11:58,830 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-20 08:11:58,961 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 30 [2019-11-20 08:11:58,961 INFO L567 ElimStorePlain]: treesize reduction 336, result has 15.4 percent of original size [2019-11-20 08:11:58,961 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:11:58,962 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:60 [2019-11-20 08:11:59,053 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_85|], 12=[|v_#memory_$Pointer$.base_92|]} [2019-11-20 08:11:59,082 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:59,082 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 68 [2019-11-20 08:11:59,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:59,155 INFO L567 ElimStorePlain]: treesize reduction 26, result has 78.3 percent of original size [2019-11-20 08:11:59,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 08:11:59,280 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-20 08:11:59,281 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:59,281 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 84 treesize of output 170 [2019-11-20 08:11:59,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:11:59,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:11:59,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:11:59,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:11:59,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:11:59,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:11:59,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:11:59,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:11:59,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:11:59,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:11:59,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:11:59,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:11:59,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:11:59,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:11:59,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:11:59,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:11:59,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:11:59,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:11:59,294 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 9 xjuncts. [2019-11-20 08:11:59,601 WARN L191 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 32 [2019-11-20 08:11:59,601 INFO L567 ElimStorePlain]: treesize reduction 6802, result has 1.2 percent of original size [2019-11-20 08:11:59,602 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 08:11:59,602 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:104, output treesize:84 [2019-11-20 08:12:05,763 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2019-11-20 08:12:05,763 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:12:05,779 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:12:05,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:12:05,780 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:66, output treesize:42 [2019-11-20 08:12:06,034 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:12:06,034 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:12:06,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:12:06,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:12:18,076 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 34 [2019-11-20 08:12:42,720 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 40 [2019-11-20 08:12:42,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:12:42,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:12:42,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:12:44,851 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 45 [2019-11-20 08:12:44,854 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_19], 3=[|#memory_$Pointer$.offset|]} [2019-11-20 08:12:44,861 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 40 treesize of output 36 [2019-11-20 08:12:44,861 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:12:44,899 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:12:44,918 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:12:44,918 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 57 [2019-11-20 08:12:44,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:12:44,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:12:44,920 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:12:45,015 INFO L567 ElimStorePlain]: treesize reduction 11, result has 85.9 percent of original size [2019-11-20 08:12:45,015 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-20 08:12:45,016 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-11-20 08:12:47,113 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:12:47,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1455540309] [2019-11-20 08:12:47,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:12:47,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 26 [2019-11-20 08:12:47,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708585828] [2019-11-20 08:12:47,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-20 08:12:47,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:12:47,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-20 08:12:47,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=530, Unknown=6, NotChecked=0, Total=650 [2019-11-20 08:12:47,115 INFO L87 Difference]: Start difference. First operand 266 states and 348 transitions. Second operand 26 states. [2019-11-20 08:13:16,456 WARN L191 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 81 DAG size of output: 43 [2019-11-20 08:13:24,593 WARN L191 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 73 DAG size of output: 41 [2019-11-20 08:13:33,000 WARN L191 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 78 DAG size of output: 46 [2019-11-20 08:13:35,306 WARN L191 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 80 DAG size of output: 48 [2019-11-20 08:13:37,779 WARN L191 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 57 [2019-11-20 08:13:42,120 WARN L191 SmtUtils]: Spent 4.17 s on a formula simplification that was a NOOP. DAG size: 60 [2019-11-20 08:14:31,746 WARN L191 SmtUtils]: Spent 32.79 s on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-11-20 08:14:37,967 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((|v_main_#t~malloc17.base_7| (_ BitVec 32))) (not (= (select |c_#valid| |v_main_#t~malloc17.base_7|) (_ bv0 1)))))) (and (or (forall ((|main_#t~malloc17.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.offset| c_main_~n~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~n~0.base) (bvadd c_main_~n~0.offset (_ bv4 32)) |main_#t~malloc17.offset|)) c_main_~root~0.base) c_main_~root~0.offset))) .cse0) (not |c_main_#t~short6|) (forall ((|v_main_#t~malloc17.base_7| (_ BitVec 32))) (or (= (select (select (store |c_#memory_$Pointer$.base| c_main_~n~0.base (store (select |c_#memory_$Pointer$.base| c_main_~n~0.base) (bvadd c_main_~n~0.offset (_ bv4 32)) |v_main_#t~malloc17.base_7|)) c_main_~root~0.base) c_main_~root~0.offset) (_ bv0 32)) (not (= (select |c_#valid| |v_main_#t~malloc17.base_7|) (_ bv0 1))))) (= (bvadd (select |c_#valid| c_main_~root~0.base) (_ bv1 1)) (_ bv0 1)) (= c_main_~root~0.offset (_ bv0 32)) (or .cse0 (and (= c_main_~n~0.base c_main_~root~0.base) (= c_main_~root~0.offset c_main_~n~0.offset)) (not (= (select (select |c_#memory_$Pointer$.base| c_main_~n~0.base) c_main_~n~0.offset) (_ bv0 32)))))) is different from false [2019-11-20 08:15:44,282 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((|v_main_#t~malloc17.base_7| (_ BitVec 32))) (not (= (select |c_#valid| |v_main_#t~malloc17.base_7|) (_ bv0 1)))))) (and (or (forall ((|main_#t~malloc17.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.offset| c_main_~n~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~n~0.base) (bvadd c_main_~n~0.offset (_ bv4 32)) |main_#t~malloc17.offset|)) c_main_~root~0.base) c_main_~root~0.offset))) .cse0) (forall ((|v_main_#t~malloc17.base_7| (_ BitVec 32))) (or (= (select (select (store |c_#memory_$Pointer$.base| c_main_~n~0.base (store (select |c_#memory_$Pointer$.base| c_main_~n~0.base) (bvadd c_main_~n~0.offset (_ bv4 32)) |v_main_#t~malloc17.base_7|)) c_main_~root~0.base) c_main_~root~0.offset) (_ bv0 32)) (not (= (select |c_#valid| |v_main_#t~malloc17.base_7|) (_ bv0 1))))) (or .cse0 (and (= c_main_~n~0.base c_main_~root~0.base) (= c_main_~root~0.offset c_main_~n~0.offset)) (not (= (select (select |c_#memory_$Pointer$.base| c_main_~n~0.base) c_main_~n~0.offset) (_ bv0 32)))))) is different from false [2019-11-20 08:16:33,609 WARN L191 SmtUtils]: Spent 40.61 s on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-11-20 08:16:37,887 WARN L191 SmtUtils]: Spent 4.12 s on a formula simplification that was a NOOP. DAG size: 48 [2019-11-20 08:17:42,786 WARN L191 SmtUtils]: Spent 46.45 s on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-20 08:17:45,103 WARN L191 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 45 [2019-11-20 08:18:01,421 WARN L191 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 36 [2019-11-20 08:18:55,502 WARN L191 SmtUtils]: Spent 32.59 s on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-11-20 08:18:59,390 WARN L191 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 52 [2019-11-20 08:19:45,272 WARN L191 SmtUtils]: Spent 41.81 s on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-11-20 08:19:51,983 WARN L191 SmtUtils]: Spent 4.53 s on a formula simplification that was a NOOP. DAG size: 55 [2019-11-20 08:20:35,849 WARN L191 SmtUtils]: Spent 39.81 s on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-11-20 08:20:42,292 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((|v_main_#t~malloc17.base_7| (_ BitVec 32))) (not (= (select |c_#valid| |v_main_#t~malloc17.base_7|) (_ bv0 1)))))) (and (or (forall ((|main_#t~malloc17.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.offset| c_main_~n~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~n~0.base) (bvadd c_main_~n~0.offset (_ bv4 32)) |main_#t~malloc17.offset|)) c_main_~root~0.base) c_main_~root~0.offset))) .cse0) (not |c_main_#t~short6|) (forall ((|v_main_#t~malloc17.base_7| (_ BitVec 32))) (or (= (select (select (store |c_#memory_$Pointer$.base| c_main_~n~0.base (store (select |c_#memory_$Pointer$.base| c_main_~n~0.base) (bvadd c_main_~n~0.offset (_ bv4 32)) |v_main_#t~malloc17.base_7|)) c_main_~root~0.base) c_main_~root~0.offset) (_ bv0 32)) (not (= (select |c_#valid| |v_main_#t~malloc17.base_7|) (_ bv0 1))))) (or .cse0 (and (= c_main_~n~0.base c_main_~root~0.base) (= c_main_~root~0.offset c_main_~n~0.offset)) (not (= (select (select |c_#memory_$Pointer$.base| c_main_~n~0.base) c_main_~n~0.offset) (_ bv0 32)))))) is different from false [2019-11-20 08:21:19,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:21:19,081 INFO L93 Difference]: Finished difference Result 826 states and 1007 transitions. [2019-11-20 08:21:19,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-11-20 08:21:19,081 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 35 [2019-11-20 08:21:19,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:21:19,084 INFO L225 Difference]: With dead ends: 826 [2019-11-20 08:21:19,084 INFO L226 Difference]: Without dead ends: 826 [2019-11-20 08:21:19,086 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1087 ImplicationChecksByTransitivity, 410.7s TimeCoverageRelationStatistics Valid=778, Invalid=2844, Unknown=50, NotChecked=360, Total=4032 [2019-11-20 08:21:19,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2019-11-20 08:21:19,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 272. [2019-11-20 08:21:19,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-11-20 08:21:19,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 348 transitions. [2019-11-20 08:21:19,114 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 348 transitions. Word has length 35 [2019-11-20 08:21:19,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:21:19,115 INFO L462 AbstractCegarLoop]: Abstraction has 272 states and 348 transitions. [2019-11-20 08:21:19,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-20 08:21:19,115 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 348 transitions. [2019-11-20 08:21:19,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-20 08:21:19,116 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:21:19,116 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:21:19,319 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:21:19,319 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr55ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-20 08:21:19,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:21:19,320 INFO L82 PathProgramCache]: Analyzing trace with hash -785240439, now seen corresponding path program 1 times [2019-11-20 08:21:19,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:21:19,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1448058660] [2019-11-20 08:21:19,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:21:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:21:19,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-20 08:21:19,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:21:19,546 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 08:21:19,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:21:19,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:21:19,555 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:21:19,555 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 08:21:19,610 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:21:19,611 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2019-11-20 08:21:19,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:21:19,647 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-20 08:21:19,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:21:19,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-11-20 08:21:19,668 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 08:21:19,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:21:19,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:21:19,693 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:21:19,693 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:34 [2019-11-20 08:21:19,782 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:21:19,782 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 51 [2019-11-20 08:21:19,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:19,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-20 08:21:19,838 INFO L567 ElimStorePlain]: treesize reduction 53, result has 46.5 percent of original size [2019-11-20 08:21:19,838 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:21:19,838 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2019-11-20 08:21:19,999 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:21:19,999 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 101 [2019-11-20 08:21:20,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:20,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:20,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:20,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:20,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:20,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:20,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:20,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-11-20 08:21:20,139 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 29 [2019-11-20 08:21:20,140 INFO L567 ElimStorePlain]: treesize reduction 370, result has 12.9 percent of original size [2019-11-20 08:21:20,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 08:21:20,140 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:54 [2019-11-20 08:21:26,258 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:21:26,258 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 33 [2019-11-20 08:21:26,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:21:26,283 INFO L567 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2019-11-20 08:21:26,283 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:21:26,284 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:17 [2019-11-20 08:21:26,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:21:26,330 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:21:26,873 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 1016 treesize of output 1000 [2019-11-20 08:21:26,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:26,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:26,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:26,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:26,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:26,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:26,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:26,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:26,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:27,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:27,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:27,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:27,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:27,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:27,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:27,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:27,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:27,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:27,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:27,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:27,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:27,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:27,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:27,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:27,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:27,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:27,321 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:21:28,060 WARN L191 SmtUtils]: Spent 738.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2019-11-20 08:21:28,061 INFO L567 ElimStorePlain]: treesize reduction 647, result has 35.3 percent of original size [2019-11-20 08:21:28,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:28,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:21:28,378 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 106 dim-0 vars, and 9 xjuncts. [2019-11-20 08:21:28,379 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:123, output treesize:11602 [2019-11-20 08:21:29,326 WARN L191 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 968 DAG size of output: 27 [2019-11-20 08:21:29,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:21:29,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:21:29,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1448058660] [2019-11-20 08:21:29,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:21:29,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2019-11-20 08:21:29,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803725354] [2019-11-20 08:21:29,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-20 08:21:29,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:21:29,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-20 08:21:29,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=440, Unknown=3, NotChecked=0, Total=552 [2019-11-20 08:21:29,779 INFO L87 Difference]: Start difference. First operand 272 states and 348 transitions. Second operand 24 states. [2019-11-20 08:22:23,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:22:23,564 INFO L93 Difference]: Finished difference Result 621 states and 791 transitions. [2019-11-20 08:22:23,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-20 08:22:23,565 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 36 [2019-11-20 08:22:23,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:22:23,567 INFO L225 Difference]: With dead ends: 621 [2019-11-20 08:22:23,567 INFO L226 Difference]: Without dead ends: 621 [2019-11-20 08:22:23,568 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 47.1s TimeCoverageRelationStatistics Valid=431, Invalid=1187, Unknown=22, NotChecked=0, Total=1640 [2019-11-20 08:22:23,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-11-20 08:22:23,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 330. [2019-11-20 08:22:23,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-11-20 08:22:23,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 430 transitions. [2019-11-20 08:22:23,574 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 430 transitions. Word has length 36 [2019-11-20 08:22:23,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:22:23,575 INFO L462 AbstractCegarLoop]: Abstraction has 330 states and 430 transitions. [2019-11-20 08:22:23,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-20 08:22:23,575 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 430 transitions. [2019-11-20 08:22:23,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-20 08:22:23,575 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:22:23,576 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:22:23,779 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:22:23,779 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr55ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-20 08:22:23,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:22:23,779 INFO L82 PathProgramCache]: Analyzing trace with hash -785240438, now seen corresponding path program 1 times [2019-11-20 08:22:23,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:22:23,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [74178048] [2019-11-20 08:22:23,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce8fe71a-945c-4a1c-86e3-b49dbdcf48ae/bin/uautomizer/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:22:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:22:24,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-20 08:22:24,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:22:24,022 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 08:22:24,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:22:24,026 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:22:24,027 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:22:24,027 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 08:22:24,043 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_85|], 1=[|v_#valid_187|]} [2019-11-20 08:22:24,046 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 08:22:24,046 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:22:24,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:22:24,070 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:22:24,070 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-20 08:22:24,071 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:22:24,083 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:22:24,083 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:22:24,083 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:22 [2019-11-20 08:22:24,105 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 08:22:24,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:22:24,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:22:24,126 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 08:22:24,127 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:22:24,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:22:24,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:22:24,142 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:34 [2019-11-20 08:22:24,192 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2019-11-20 08:22:24,192 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:22:24,214 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:22:24,245 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:22:24,245 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 58 [2019-11-20 08:22:24,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:22:24,246 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-20 08:22:24,296 INFO L567 ElimStorePlain]: treesize reduction 60, result has 48.7 percent of original size [2019-11-20 08:22:24,296 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:22:24,297 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:56 [2019-11-20 08:22:24,422 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:22:24,422 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 62 [2019-11-20 08:22:24,423 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:22:24,489 INFO L567 ElimStorePlain]: treesize reduction 24, result has 77.8 percent of original size [2019-11-20 08:22:24,543 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:22:24,544 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 115 [2019-11-20 08:22:24,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:22:24,545 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:22:24,606 INFO L567 ElimStorePlain]: treesize reduction 66, result has 53.5 percent of original size [2019-11-20 08:22:24,606 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 08:22:24,606 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:92, output treesize:76 [2019-11-20 08:22:30,700 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-11-20 08:22:32,773 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:22:32,773 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 42 [2019-11-20 08:22:32,773 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:22:32,803 INFO L567 ElimStorePlain]: treesize reduction 14, result has 70.2 percent of original size [2019-11-20 08:22:32,806 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 24 treesize of output 10 [2019-11-20 08:22:32,806 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:22:32,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:22:32,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:22:32,813 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:9 [2019-11-20 08:22:32,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:22:32,870 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:22:36,142 WARN L191 SmtUtils]: Spent 443.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-11-20 08:22:40,803 WARN L191 SmtUtils]: Spent 968.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-11-20 08:22:55,580 WARN L191 SmtUtils]: Spent 2.44 s on a formula simplification that was a NOOP. DAG size: 69 [2019-11-20 08:23:50,819 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-11-20 08:23:51,019 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:23:51,020 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:140) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:899) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:576) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 42 more [2019-11-20 08:23:51,024 INFO L168 Benchmark]: Toolchain (without parser) took 753824.75 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 304.1 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -115.6 MB). Peak memory consumption was 188.5 MB. Max. memory is 11.5 GB. [2019-11-20 08:23:51,024 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 08:23:51,024 INFO L168 Benchmark]: CACSL2BoogieTranslator took 531.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -164.3 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-20 08:23:51,025 INFO L168 Benchmark]: Boogie Preprocessor took 79.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 08:23:51,025 INFO L168 Benchmark]: RCFGBuilder took 939.60 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: 69.8 MB). Peak memory consumption was 69.8 MB. Max. memory is 11.5 GB. [2019-11-20 08:23:51,025 INFO L168 Benchmark]: TraceAbstraction took 752270.71 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 172.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -21.2 MB). Peak memory consumption was 150.8 MB. Max. memory is 11.5 GB. [2019-11-20 08:23:51,026 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 531.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -164.3 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 79.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 939.60 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: 69.8 MB). Peak memory consumption was 69.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 752270.71 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 172.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -21.2 MB). Peak memory consumption was 150.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...