./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/list-properties/alternating_list-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) 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_0613eb54-c233-4d97-83c5-b67887bba5f7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0613eb54-c233-4d97-83c5-b67887bba5f7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0613eb54-c233-4d97-83c5-b67887bba5f7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0613eb54-c233-4d97-83c5-b67887bba5f7/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-properties/alternating_list-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0613eb54-c233-4d97-83c5-b67887bba5f7/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0613eb54-c233-4d97-83c5-b67887bba5f7/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9c54128245d3ab9ad313da188c7be33f66027c6a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 09:44:12,995 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 09:44:12,997 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 09:44:13,014 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 09:44:13,014 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 09:44:13,016 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 09:44:13,018 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 09:44:13,029 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 09:44:13,035 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 09:44:13,038 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 09:44:13,040 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 09:44:13,046 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 09:44:13,046 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 09:44:13,050 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 09:44:13,052 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 09:44:13,053 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 09:44:13,054 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 09:44:13,057 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 09:44:13,060 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 09:44:13,064 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 09:44:13,069 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 09:44:13,071 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 09:44:13,075 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 09:44:13,076 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 09:44:13,079 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 09:44:13,079 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 09:44:13,080 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 09:44:13,082 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 09:44:13,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 09:44:13,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 09:44:13,084 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 09:44:13,085 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 09:44:13,086 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 09:44:13,087 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 09:44:13,088 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 09:44:13,089 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 09:44:13,090 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 09:44:13,091 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 09:44:13,091 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 09:44:13,092 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 09:44:13,093 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 09:44:13,094 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0613eb54-c233-4d97-83c5-b67887bba5f7/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2019-11-20 09:44:13,123 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 09:44:13,125 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 09:44:13,137 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 09:44:13,138 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 09:44:13,138 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 09:44:13,138 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 09:44:13,139 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 09:44:13,139 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 09:44:13,139 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 09:44:13,139 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 09:44:13,140 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 09:44:13,140 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-20 09:44:13,140 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-20 09:44:13,140 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 09:44:13,141 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 09:44:13,141 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 09:44:13,141 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 09:44:13,142 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 09:44:13,142 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 09:44:13,142 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 09:44:13,142 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 09:44:13,143 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 09:44:13,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 09:44:13,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 09:44:13,144 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 09:44:13,144 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 09:44:13,144 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 09:44:13,144 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 09:44:13,147 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_0613eb54-c233-4d97-83c5-b67887bba5f7/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9c54128245d3ab9ad313da188c7be33f66027c6a [2019-11-20 09:44:13,316 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 09:44:13,333 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 09:44:13,336 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 09:44:13,337 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 09:44:13,338 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 09:44:13,339 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0613eb54-c233-4d97-83c5-b67887bba5f7/bin/uautomizer/../../sv-benchmarks/c/list-properties/alternating_list-2.i [2019-11-20 09:44:13,421 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0613eb54-c233-4d97-83c5-b67887bba5f7/bin/uautomizer/data/8e2ba7ec5/0343c7fe93dd460a9b1322411179cee9/FLAG7b835c48d [2019-11-20 09:44:14,009 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 09:44:14,010 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0613eb54-c233-4d97-83c5-b67887bba5f7/sv-benchmarks/c/list-properties/alternating_list-2.i [2019-11-20 09:44:14,037 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0613eb54-c233-4d97-83c5-b67887bba5f7/bin/uautomizer/data/8e2ba7ec5/0343c7fe93dd460a9b1322411179cee9/FLAG7b835c48d [2019-11-20 09:44:14,233 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0613eb54-c233-4d97-83c5-b67887bba5f7/bin/uautomizer/data/8e2ba7ec5/0343c7fe93dd460a9b1322411179cee9 [2019-11-20 09:44:14,236 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 09:44:14,237 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-20 09:44:14,238 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 09:44:14,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 09:44:14,242 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 09:44:14,243 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:44:14" (1/1) ... [2019-11-20 09:44:14,245 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2708cf20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:44:14, skipping insertion in model container [2019-11-20 09:44:14,245 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:44:14" (1/1) ... [2019-11-20 09:44:14,251 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 09:44:14,306 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 09:44:14,768 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 09:44:14,786 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 09:44:14,836 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 09:44:14,913 INFO L192 MainTranslator]: Completed translation [2019-11-20 09:44:14,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:44:14 WrapperNode [2019-11-20 09:44:14,914 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 09:44:14,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 09:44:14,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 09:44:14,916 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 09:44:14,928 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:44:14" (1/1) ... [2019-11-20 09:44:14,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:44:14" (1/1) ... [2019-11-20 09:44:14,947 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:44:14" (1/1) ... [2019-11-20 09:44:14,948 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:44:14" (1/1) ... [2019-11-20 09:44:14,971 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:44:14" (1/1) ... [2019-11-20 09:44:14,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:44:14" (1/1) ... [2019-11-20 09:44:14,982 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:44:14" (1/1) ... [2019-11-20 09:44:14,990 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 09:44:14,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 09:44:14,991 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 09:44:14,992 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 09:44:14,993 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:44:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0613eb54-c233-4d97-83c5-b67887bba5f7/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 09:44:15,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-20 09:44:15,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 09:44:15,066 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-20 09:44:15,067 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-20 09:44:15,067 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-20 09:44:15,067 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-20 09:44:15,068 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-20 09:44:15,068 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-20 09:44:15,074 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-20 09:44:15,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-20 09:44:15,076 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-20 09:44:15,076 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-20 09:44:15,076 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-20 09:44:15,077 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-20 09:44:15,077 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-20 09:44:15,077 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-20 09:44:15,080 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-20 09:44:15,080 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-20 09:44:15,080 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-20 09:44:15,081 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-20 09:44:15,081 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-20 09:44:15,081 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-20 09:44:15,081 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-20 09:44:15,082 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-20 09:44:15,082 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-20 09:44:15,082 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-20 09:44:15,083 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-20 09:44:15,083 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-20 09:44:15,083 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-20 09:44:15,083 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-20 09:44:15,083 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-20 09:44:15,084 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-20 09:44:15,084 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-20 09:44:15,084 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-20 09:44:15,084 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-20 09:44:15,085 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-20 09:44:15,085 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-20 09:44:15,085 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-20 09:44:15,085 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-20 09:44:15,085 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-20 09:44:15,086 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-20 09:44:15,086 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-20 09:44:15,086 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-20 09:44:15,086 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-20 09:44:15,086 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-20 09:44:15,088 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-20 09:44:15,088 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-20 09:44:15,089 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-20 09:44:15,089 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-20 09:44:15,089 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-20 09:44:15,089 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-20 09:44:15,089 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-20 09:44:15,090 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-20 09:44:15,090 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-20 09:44:15,090 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-20 09:44:15,090 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-20 09:44:15,090 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-20 09:44:15,091 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-20 09:44:15,091 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-20 09:44:15,091 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-20 09:44:15,092 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-20 09:44:15,092 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-20 09:44:15,092 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-20 09:44:15,092 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-20 09:44:15,093 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-20 09:44:15,093 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-20 09:44:15,093 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-20 09:44:15,093 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-20 09:44:15,094 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-20 09:44:15,095 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-20 09:44:15,095 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-20 09:44:15,095 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-20 09:44:15,096 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-20 09:44:15,096 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-20 09:44:15,097 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-20 09:44:15,097 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-20 09:44:15,098 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-20 09:44:15,099 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-20 09:44:15,099 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-20 09:44:15,099 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-20 09:44:15,099 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-20 09:44:15,099 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-20 09:44:15,100 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-20 09:44:15,100 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-20 09:44:15,100 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-20 09:44:15,100 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-20 09:44:15,100 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-20 09:44:15,101 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-20 09:44:15,101 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-20 09:44:15,101 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-20 09:44:15,101 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-20 09:44:15,101 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-20 09:44:15,102 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-20 09:44:15,102 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-20 09:44:15,102 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-20 09:44:15,102 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-20 09:44:15,102 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-20 09:44:15,103 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-20 09:44:15,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-20 09:44:15,103 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-20 09:44:15,103 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-20 09:44:15,104 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-20 09:44:15,104 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-20 09:44:15,104 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-20 09:44:15,104 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-20 09:44:15,104 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-20 09:44:15,105 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-20 09:44:15,105 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-20 09:44:15,105 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-20 09:44:15,105 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-20 09:44:15,105 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-20 09:44:15,106 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-20 09:44:15,106 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-20 09:44:15,106 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-20 09:44:15,106 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-20 09:44:15,107 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-20 09:44:15,107 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-20 09:44:15,107 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-20 09:44:15,107 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-20 09:44:15,108 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-20 09:44:15,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 09:44:15,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 09:44:15,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 09:44:15,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 09:44:15,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 09:44:15,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 09:44:15,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-20 09:44:15,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 09:44:15,665 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-20 09:44:16,117 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 09:44:16,117 INFO L285 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-20 09:44:16,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:44:16 BoogieIcfgContainer [2019-11-20 09:44:16,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 09:44:16,120 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 09:44:16,120 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 09:44:16,123 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 09:44:16,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:44:14" (1/3) ... [2019-11-20 09:44:16,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24e84b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:44:16, skipping insertion in model container [2019-11-20 09:44:16,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:44:14" (2/3) ... [2019-11-20 09:44:16,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24e84b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:44:16, skipping insertion in model container [2019-11-20 09:44:16,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:44:16" (3/3) ... [2019-11-20 09:44:16,127 INFO L109 eAbstractionObserver]: Analyzing ICFG alternating_list-2.i [2019-11-20 09:44:16,139 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 09:44:16,146 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2019-11-20 09:44:16,174 INFO L249 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2019-11-20 09:44:16,201 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 09:44:16,201 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-20 09:44:16,202 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 09:44:16,202 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 09:44:16,202 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 09:44:16,202 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 09:44:16,203 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 09:44:16,203 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 09:44:16,231 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2019-11-20 09:44:16,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 09:44:16,248 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:44:16,249 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:44:16,250 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 09:44:16,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:44:16,257 INFO L82 PathProgramCache]: Analyzing trace with hash -655644872, now seen corresponding path program 1 times [2019-11-20 09:44:16,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:44:16,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [988096494] [2019-11-20 09:44:16,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0613eb54-c233-4d97-83c5-b67887bba5f7/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 09:44:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:44:16,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 09:44:16,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:44:16,612 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 09:44:16,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:16,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:16,623 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:44:16,623 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 09:44:16,647 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 09:44:16,648 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:44:16,664 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 09:44:16,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [988096494] [2019-11-20 09:44:16,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:44:16,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 09:44:16,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24511940] [2019-11-20 09:44:16,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 09:44:16,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:44:16,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 09:44:16,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:44:16,695 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 4 states. [2019-11-20 09:44:17,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:44:17,129 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2019-11-20 09:44:17,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 09:44:17,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-20 09:44:17,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:44:17,146 INFO L225 Difference]: With dead ends: 99 [2019-11-20 09:44:17,146 INFO L226 Difference]: Without dead ends: 91 [2019-11-20 09:44:17,150 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 09:44:17,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-20 09:44:17,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 71. [2019-11-20 09:44:17,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-20 09:44:17,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2019-11-20 09:44:17,230 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 10 [2019-11-20 09:44:17,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:44:17,231 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2019-11-20 09:44:17,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 09:44:17,232 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2019-11-20 09:44:17,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 09:44:17,234 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:44:17,234 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:44:17,437 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:44:17,438 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 09:44:17,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:44:17,439 INFO L82 PathProgramCache]: Analyzing trace with hash -655644871, now seen corresponding path program 1 times [2019-11-20 09:44:17,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:44:17,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1146210084] [2019-11-20 09:44:17,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0613eb54-c233-4d97-83c5-b67887bba5f7/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 09:44:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:44:17,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 09:44:17,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:44:17,679 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 09:44:17,680 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:17,694 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:17,694 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:44:17,694 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 09:44:17,737 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 09:44:17,737 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:44:17,830 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 09:44:17,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1146210084] [2019-11-20 09:44:17,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:44:17,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-20 09:44:17,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660477907] [2019-11-20 09:44:17,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 09:44:17,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:44:17,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 09:44:17,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 09:44:17,834 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand 6 states. [2019-11-20 09:44:18,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:44:18,382 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2019-11-20 09:44:18,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 09:44:18,383 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-20 09:44:18,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:44:18,384 INFO L225 Difference]: With dead ends: 95 [2019-11-20 09:44:18,384 INFO L226 Difference]: Without dead ends: 95 [2019-11-20 09:44:18,385 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 09:44:18,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-20 09:44:18,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2019-11-20 09:44:18,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-20 09:44:18,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2019-11-20 09:44:18,397 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 10 [2019-11-20 09:44:18,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:44:18,397 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2019-11-20 09:44:18,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 09:44:18,398 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2019-11-20 09:44:18,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 09:44:18,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:44:18,398 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 09:44:18,599 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:44:18,600 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 09:44:18,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:44:18,600 INFO L82 PathProgramCache]: Analyzing trace with hash 952624162, now seen corresponding path program 1 times [2019-11-20 09:44:18,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:44:18,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [709843836] [2019-11-20 09:44:18,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0613eb54-c233-4d97-83c5-b67887bba5f7/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 09:44:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:44:18,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 09:44:18,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:44:18,919 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 09:44:18,919 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:44:18,970 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 09:44:18,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [709843836] [2019-11-20 09:44:18,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:44:18,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [] total 6 [2019-11-20 09:44:18,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095152771] [2019-11-20 09:44:18,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 09:44:18,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:44:18,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 09:44:18,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-20 09:44:18,973 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 7 states. [2019-11-20 09:44:19,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:44:19,362 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2019-11-20 09:44:19,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 09:44:19,363 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-20 09:44:19,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:44:19,364 INFO L225 Difference]: With dead ends: 91 [2019-11-20 09:44:19,365 INFO L226 Difference]: Without dead ends: 91 [2019-11-20 09:44:19,365 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 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 09:44:19,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-20 09:44:19,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2019-11-20 09:44:19,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-20 09:44:19,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2019-11-20 09:44:19,374 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 18 [2019-11-20 09:44:19,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:44:19,374 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2019-11-20 09:44:19,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 09:44:19,374 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2019-11-20 09:44:19,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 09:44:19,376 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:44:19,376 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 09:44:19,581 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:44:19,581 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 09:44:19,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:44:19,582 INFO L82 PathProgramCache]: Analyzing trace with hash -533376169, now seen corresponding path program 1 times [2019-11-20 09:44:19,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:44:19,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1341419958] [2019-11-20 09:44:19,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0613eb54-c233-4d97-83c5-b67887bba5f7/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 09:44:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:44:19,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 09:44:19,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:44:19,843 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 09:44:19,843 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:44:19,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:44:19,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1341419958] [2019-11-20 09:44:19,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:44:19,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 09:44:19,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89958426] [2019-11-20 09:44:19,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 09:44:19,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:44:19,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 09:44:19,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 09:44:19,857 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand 5 states. [2019-11-20 09:44:20,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:44:20,109 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2019-11-20 09:44:20,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 09:44:20,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-20 09:44:20,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:44:20,111 INFO L225 Difference]: With dead ends: 95 [2019-11-20 09:44:20,111 INFO L226 Difference]: Without dead ends: 95 [2019-11-20 09:44:20,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 09:44:20,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-20 09:44:20,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2019-11-20 09:44:20,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-20 09:44:20,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2019-11-20 09:44:20,120 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 19 [2019-11-20 09:44:20,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:44:20,121 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2019-11-20 09:44:20,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 09:44:20,121 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2019-11-20 09:44:20,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 09:44:20,122 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:44:20,122 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 09:44:20,323 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:44:20,325 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 09:44:20,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:44:20,325 INFO L82 PathProgramCache]: Analyzing trace with hash 439071551, now seen corresponding path program 1 times [2019-11-20 09:44:20,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:44:20,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1010738358] [2019-11-20 09:44:20,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0613eb54-c233-4d97-83c5-b67887bba5f7/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 09:44:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:44:20,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 09:44:20,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:44:20,594 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 09:44:20,594 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:20,601 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:20,602 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:44:20,602 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-20 09:44:20,650 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 09:44:20,651 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:20,657 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:20,658 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 09:44:20,658 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-11-20 09:44:20,668 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 09:44:20,668 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:44:20,747 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 12 [2019-11-20 09:44:20,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-20 09:44:20,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:20,756 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-20 09:44:20,756 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-11-20 09:44:20,784 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 09:44:20,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1010738358] [2019-11-20 09:44:20,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:44:20,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2019-11-20 09:44:20,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616474544] [2019-11-20 09:44:20,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 09:44:20,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:44:20,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 09:44:20,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-20 09:44:20,787 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 11 states. [2019-11-20 09:44:21,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:44:21,703 INFO L93 Difference]: Finished difference Result 230 states and 246 transitions. [2019-11-20 09:44:21,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 09:44:21,709 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-11-20 09:44:21,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:44:21,711 INFO L225 Difference]: With dead ends: 230 [2019-11-20 09:44:21,711 INFO L226 Difference]: Without dead ends: 226 [2019-11-20 09:44:21,712 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2019-11-20 09:44:21,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-11-20 09:44:21,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 99. [2019-11-20 09:44:21,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-20 09:44:21,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2019-11-20 09:44:21,734 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 19 [2019-11-20 09:44:21,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:44:21,734 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2019-11-20 09:44:21,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 09:44:21,735 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2019-11-20 09:44:21,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 09:44:21,736 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:44:21,737 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 09:44:21,939 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:44:21,939 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 09:44:21,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:44:21,940 INFO L82 PathProgramCache]: Analyzing trace with hash 734896181, now seen corresponding path program 1 times [2019-11-20 09:44:21,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:44:21,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [310606348] [2019-11-20 09:44:21,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0613eb54-c233-4d97-83c5-b67887bba5f7/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 09:44:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:44:22,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 09:44:22,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:44:22,120 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 09:44:22,120 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:44:22,132 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 09:44:22,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [310606348] [2019-11-20 09:44:22,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:44:22,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 09:44:22,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480596148] [2019-11-20 09:44:22,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 09:44:22,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:44:22,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 09:44:22,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:44:22,134 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand 4 states. [2019-11-20 09:44:22,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:44:22,153 INFO L93 Difference]: Finished difference Result 145 states and 158 transitions. [2019-11-20 09:44:22,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 09:44:22,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-20 09:44:22,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:44:22,155 INFO L225 Difference]: With dead ends: 145 [2019-11-20 09:44:22,155 INFO L226 Difference]: Without dead ends: 144 [2019-11-20 09:44:22,156 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 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 09:44:22,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-20 09:44:22,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 102. [2019-11-20 09:44:22,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-20 09:44:22,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 119 transitions. [2019-11-20 09:44:22,177 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 119 transitions. Word has length 19 [2019-11-20 09:44:22,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:44:22,177 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 119 transitions. [2019-11-20 09:44:22,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 09:44:22,177 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 119 transitions. [2019-11-20 09:44:22,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 09:44:22,178 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:44:22,178 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 09:44:22,378 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:44:22,379 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 09:44:22,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:44:22,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1214032540, now seen corresponding path program 1 times [2019-11-20 09:44:22,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:44:22,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1622899273] [2019-11-20 09:44:22,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0613eb54-c233-4d97-83c5-b67887bba5f7/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 09:44:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:44:22,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 09:44:22,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:44:22,600 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:22,600 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-20 09:44:22,601 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:22,631 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-20 09:44:22,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:44:22,631 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-20 09:44:22,666 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 09:44:22,666 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:22,688 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:22,689 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 09:44:22,690 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:17 [2019-11-20 09:44:22,722 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 09:44:22,723 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:22,729 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:22,730 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 09:44:22,730 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2019-11-20 09:44:22,751 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 09:44:22,751 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:44:22,784 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 09:44:22,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1622899273] [2019-11-20 09:44:22,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:44:22,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-11-20 09:44:22,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379632823] [2019-11-20 09:44:22,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 09:44:22,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:44:22,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 09:44:22,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-20 09:44:22,786 INFO L87 Difference]: Start difference. First operand 102 states and 119 transitions. Second operand 8 states. [2019-11-20 09:44:23,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:44:23,371 INFO L93 Difference]: Finished difference Result 115 states and 132 transitions. [2019-11-20 09:44:23,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 09:44:23,372 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-20 09:44:23,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:44:23,374 INFO L225 Difference]: With dead ends: 115 [2019-11-20 09:44:23,374 INFO L226 Difference]: Without dead ends: 115 [2019-11-20 09:44:23,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-20 09:44:23,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-20 09:44:23,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2019-11-20 09:44:23,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-20 09:44:23,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2019-11-20 09:44:23,383 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 19 [2019-11-20 09:44:23,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:44:23,384 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2019-11-20 09:44:23,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 09:44:23,384 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2019-11-20 09:44:23,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 09:44:23,385 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:44:23,385 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 09:44:23,588 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:44:23,588 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 09:44:23,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:44:23,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1214032541, now seen corresponding path program 1 times [2019-11-20 09:44:23,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:44:23,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1090177580] [2019-11-20 09:44:23,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0613eb54-c233-4d97-83c5-b67887bba5f7/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 09:44:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:44:23,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 09:44:23,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:44:23,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 09:44:23,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:23,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:23,788 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:44:23,788 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 09:44:23,810 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 09:44:23,810 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:23,825 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:23,830 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 09:44:23,830 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:23,848 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:23,849 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 09:44:23,850 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2019-11-20 09:44:23,908 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-20 09:44:23,909 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:23,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:23,922 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 09:44:23,923 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:23,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:23,929 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 09:44:23,929 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-11-20 09:44:23,967 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 09:44:23,967 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:44:24,179 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 09:44:24,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1090177580] [2019-11-20 09:44:24,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:44:24,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 09:44:24,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873725231] [2019-11-20 09:44:24,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 09:44:24,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:44:24,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 09:44:24,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 09:44:24,181 INFO L87 Difference]: Start difference. First operand 99 states and 115 transitions. Second operand 10 states. [2019-11-20 09:44:25,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:44:25,463 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2019-11-20 09:44:25,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 09:44:25,465 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-20 09:44:25,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:44:25,466 INFO L225 Difference]: With dead ends: 125 [2019-11-20 09:44:25,466 INFO L226 Difference]: Without dead ends: 125 [2019-11-20 09:44:25,467 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-11-20 09:44:25,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-20 09:44:25,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 93. [2019-11-20 09:44:25,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-20 09:44:25,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2019-11-20 09:44:25,472 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 19 [2019-11-20 09:44:25,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:44:25,472 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2019-11-20 09:44:25,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 09:44:25,472 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2019-11-20 09:44:25,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 09:44:25,473 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:44:25,473 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 09:44:25,676 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:44:25,683 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 09:44:25,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:44:25,685 INFO L82 PathProgramCache]: Analyzing trace with hash 643791046, now seen corresponding path program 1 times [2019-11-20 09:44:25,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:44:25,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [889234040] [2019-11-20 09:44:25,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0613eb54-c233-4d97-83c5-b67887bba5f7/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 09:44:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:44:25,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 09:44:25,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:44:25,911 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 09:44:25,911 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:25,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:25,913 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:44:25,913 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 09:44:25,958 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 09:44:25,958 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:44:32,186 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-20 09:44:32,199 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 09:44:32,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [889234040] [2019-11-20 09:44:32,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:44:32,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 09:44:32,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194168035] [2019-11-20 09:44:32,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 09:44:32,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:44:32,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 09:44:32,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=64, Unknown=3, NotChecked=0, Total=90 [2019-11-20 09:44:32,202 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand 10 states. [2019-11-20 09:44:32,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:44:32,672 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2019-11-20 09:44:32,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 09:44:32,673 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-20 09:44:32,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:44:32,674 INFO L225 Difference]: With dead ends: 111 [2019-11-20 09:44:32,674 INFO L226 Difference]: Without dead ends: 107 [2019-11-20 09:44:32,674 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=44, Invalid=109, Unknown=3, NotChecked=0, Total=156 [2019-11-20 09:44:32,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-20 09:44:32,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2019-11-20 09:44:32,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-20 09:44:32,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2019-11-20 09:44:32,679 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 20 [2019-11-20 09:44:32,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:44:32,680 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2019-11-20 09:44:32,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 09:44:32,680 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2019-11-20 09:44:32,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 09:44:32,681 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:44:32,681 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 09:44:32,882 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:44:32,882 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 09:44:32,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:44:32,882 INFO L82 PathProgramCache]: Analyzing trace with hash 645208103, now seen corresponding path program 1 times [2019-11-20 09:44:32,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:44:32,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [820451376] [2019-11-20 09:44:32,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0613eb54-c233-4d97-83c5-b67887bba5f7/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 09:44:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:44:33,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 09:44:33,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:44:33,101 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 09:44:33,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:33,109 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:33,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:44:33,110 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-20 09:44:33,205 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 09:44:33,206 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:33,208 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:33,209 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 09:44:33,209 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2019-11-20 09:44:33,226 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 09:44:33,226 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:44:33,352 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:33,352 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 53 treesize of output 56 [2019-11-20 09:44:33,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:44:33,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:44:33,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:44:33,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:44:33,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:44:33,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:33,422 INFO L567 ElimStorePlain]: treesize reduction 43, result has 25.9 percent of original size [2019-11-20 09:44:33,423 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-20 09:44:33,423 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:7 [2019-11-20 09:44:33,448 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 09:44:33,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [820451376] [2019-11-20 09:44:33,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:44:33,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-11-20 09:44:33,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93186663] [2019-11-20 09:44:33,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 09:44:33,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:44:33,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 09:44:33,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-11-20 09:44:33,450 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand 13 states. [2019-11-20 09:44:36,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:44:36,013 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2019-11-20 09:44:36,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 09:44:36,014 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2019-11-20 09:44:36,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:44:36,015 INFO L225 Difference]: With dead ends: 112 [2019-11-20 09:44:36,015 INFO L226 Difference]: Without dead ends: 105 [2019-11-20 09:44:36,015 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2019-11-20 09:44:36,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-20 09:44:36,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96. [2019-11-20 09:44:36,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-20 09:44:36,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2019-11-20 09:44:36,019 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 20 [2019-11-20 09:44:36,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:44:36,020 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2019-11-20 09:44:36,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 09:44:36,020 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2019-11-20 09:44:36,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 09:44:36,021 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:44:36,021 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:44:36,222 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:44:36,222 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 09:44:36,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:44:36,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1812033750, now seen corresponding path program 1 times [2019-11-20 09:44:36,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:44:36,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1078192956] [2019-11-20 09:44:36,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0613eb54-c233-4d97-83c5-b67887bba5f7/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 09:44:36,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:44:36,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-20 09:44:36,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:44:36,461 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 09:44:36,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:36,467 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:36,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:44:36,467 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 09:44:36,504 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 09:44:36,505 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:36,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:36,517 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:44:36,517 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-20 09:44:36,559 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:36,560 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 09:44:36,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:36,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:36,577 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:44:36,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2019-11-20 09:44:36,609 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_23|], 2=[|v_#memory_int_25|]} [2019-11-20 09:44:36,619 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 09:44:36,619 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:36,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:36,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 09:44:36,659 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 09:44:36,659 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:36,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:36,678 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 09:44:36,678 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:29 [2019-11-20 09:44:36,733 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 20 treesize of output 8 [2019-11-20 09:44:36,734 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:36,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:36,753 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:44:36,753 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2019-11-20 09:44:36,828 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 09:44:36,829 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:36,843 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:36,844 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 09:44:36,844 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2019-11-20 09:44:36,928 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 14 [2019-11-20 09:44:36,928 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:36,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:36,936 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 09:44:36,937 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:9 [2019-11-20 09:44:36,967 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 09:44:36,968 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:44:37,265 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 09:44:37,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:37,275 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 09:44:37,275 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:36 [2019-11-20 09:44:39,609 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 274 treesize of output 266 [2019-11-20 09:44:39,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-20 09:44:39,819 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 32 [2019-11-20 09:44:39,819 INFO L567 ElimStorePlain]: treesize reduction 217, result has 15.6 percent of original size [2019-11-20 09:44:39,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:44:39,821 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 2 xjuncts. [2019-11-20 09:44:39,821 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:21 [2019-11-20 09:44:40,219 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 09:44:40,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1078192956] [2019-11-20 09:44:40,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 09:44:40,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-20 09:44:40,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795003409] [2019-11-20 09:44:40,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-20 09:44:40,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:44:40,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-20 09:44:40,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=388, Unknown=1, NotChecked=0, Total=462 [2019-11-20 09:44:40,223 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand 22 states. [2019-11-20 09:44:41,657 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-11-20 09:44:41,888 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-11-20 09:44:42,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:44:42,958 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2019-11-20 09:44:42,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-20 09:44:42,958 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2019-11-20 09:44:42,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:44:42,960 INFO L225 Difference]: With dead ends: 101 [2019-11-20 09:44:42,960 INFO L226 Difference]: Without dead ends: 97 [2019-11-20 09:44:42,961 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=259, Invalid=1000, Unknown=1, NotChecked=0, Total=1260 [2019-11-20 09:44:42,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-20 09:44:42,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2019-11-20 09:44:42,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-20 09:44:42,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2019-11-20 09:44:42,964 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 29 [2019-11-20 09:44:42,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:44:42,965 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2019-11-20 09:44:42,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-20 09:44:42,965 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2019-11-20 09:44:42,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 09:44:42,966 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:44:42,966 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:44:43,173 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:44:43,173 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 09:44:43,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:44:43,173 INFO L82 PathProgramCache]: Analyzing trace with hash -306007361, now seen corresponding path program 1 times [2019-11-20 09:44:43,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:44:43,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1344476103] [2019-11-20 09:44:43,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0613eb54-c233-4d97-83c5-b67887bba5f7/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 09:44:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:44:43,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 09:44:43,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:44:43,366 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 09:44:43,366 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:44:43,378 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 09:44:43,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1344476103] [2019-11-20 09:44:43,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:44:43,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 09:44:43,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717177091] [2019-11-20 09:44:43,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:44:43,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:44:43,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:44:43,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:44:43,381 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 3 states. [2019-11-20 09:44:43,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:44:43,402 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2019-11-20 09:44:43,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:44:43,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-20 09:44:43,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:44:43,407 INFO L225 Difference]: With dead ends: 122 [2019-11-20 09:44:43,407 INFO L226 Difference]: Without dead ends: 122 [2019-11-20 09:44:43,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 72 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 09:44:43,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-20 09:44:43,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 89. [2019-11-20 09:44:43,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-20 09:44:43,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2019-11-20 09:44:43,414 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 37 [2019-11-20 09:44:43,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:44:43,414 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2019-11-20 09:44:43,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:44:43,415 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2019-11-20 09:44:43,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 09:44:43,421 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:44:43,421 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:44:43,623 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:44:43,624 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 09:44:43,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:44:43,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1059552773, now seen corresponding path program 1 times [2019-11-20 09:44:43,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:44:43,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2046424258] [2019-11-20 09:44:43,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0613eb54-c233-4d97-83c5-b67887bba5f7/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 09:44:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:44:43,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-20 09:44:43,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:44:43,965 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 09:44:43,966 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:43,973 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:43,974 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:44:43,974 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 09:44:44,026 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:44,027 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 09:44:44,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:44,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:44,044 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:44:44,044 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-20 09:44:44,085 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 09:44:44,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:44,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:44,111 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 09:44:44,112 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-11-20 09:44:52,337 WARN L191 SmtUtils]: Spent 8.10 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-20 09:44:52,338 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:52,338 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 51 [2019-11-20 09:44:52,338 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:52,371 INFO L567 ElimStorePlain]: treesize reduction 34, result has 39.3 percent of original size [2019-11-20 09:44:52,371 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:44:52,371 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:22 [2019-11-20 09:44:52,403 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:52,404 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 09:44:52,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:52,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:52,417 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:44:52,417 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:27 [2019-11-20 09:44:52,510 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:52,511 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 1 case distinctions, treesize of input 33 treesize of output 60 [2019-11-20 09:44:52,511 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:52,595 INFO L567 ElimStorePlain]: treesize reduction 34, result has 46.9 percent of original size [2019-11-20 09:44:52,596 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 09:44:52,596 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:27 [2019-11-20 09:44:52,889 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-20 09:44:52,889 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:52,890 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 133 [2019-11-20 09:44:52,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:44:52,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:44:52,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:44:52,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:44:52,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:44:52,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:44:52,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:44:52,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:44:52,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:44:52,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:44:52,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:44:52,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:44:52,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:44:52,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:44:52,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:44:52,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:44:52,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:44:52,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:44:52,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:44:52,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:44:52,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:44:52,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:44:52,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:44:52,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:44:52,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:44:52,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:44:52,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:44:52,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:44:52,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:44:52,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:44:52,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:44:52,925 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 15 xjuncts. [2019-11-20 09:45:52,024 WARN L191 SmtUtils]: Spent 59.10 s on a formula simplification. DAG size of input: 74 DAG size of output: 33 [2019-11-20 09:45:52,024 INFO L567 ElimStorePlain]: treesize reduction 2178, result has 6.9 percent of original size [2019-11-20 09:45:52,025 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 09:45:52,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:92, output treesize:125 [2019-11-20 09:45:52,135 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 27 treesize of output 15 [2019-11-20 09:45:52,136 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:45:52,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:45:52,140 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 09:45:52,141 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:5 [2019-11-20 09:45:52,195 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:45:52,196 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:45:52,294 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 09:45:52,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:45:52,298 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 09:45:52,298 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:19 [2019-11-20 09:45:56,262 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:45:56,262 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 40 treesize of output 44 [2019-11-20 09:45:56,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:45:56,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:45:56,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:45:56,268 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 09:45:56,268 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2019-11-20 09:45:56,978 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 09:45:56,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:45:56,995 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-20 09:45:56,995 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:50 [2019-11-20 09:46:15,035 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:46:15,036 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-20 09:46:15,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:46:15,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:46:15,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-20 09:46:15,059 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:86, output treesize:77 [2019-11-20 09:46:15,645 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 1694 treesize of output 1670 [2019-11-20 09:46:15,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:15,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:15,926 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-20 09:46:17,321 WARN L191 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 120 DAG size of output: 47 [2019-11-20 09:46:17,321 INFO L567 ElimStorePlain]: treesize reduction 52155, result has 0.3 percent of original size [2019-11-20 09:46:17,322 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-20 09:46:17,322 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:87, output treesize:128 [2019-11-20 09:46:17,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:17,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:17,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:17,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:17,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:17,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:17,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:17,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:17,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:17,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:17,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:17,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:17,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:17,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:17,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:17,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:17,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:17,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:17,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:17,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:17,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:17,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:17,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:17,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:17,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:17,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:17,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:17,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:17,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:17,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:17,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:17,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:17,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:17,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:17,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:17,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:17,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:17,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:46:22,735 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:46:22,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2046424258] [2019-11-20 09:46:22,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 09:46:22,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 29 [2019-11-20 09:46:22,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040015485] [2019-11-20 09:46:22,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-20 09:46:22,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:46:22,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-20 09:46:22,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=772, Unknown=9, NotChecked=0, Total=870 [2019-11-20 09:46:22,738 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 30 states. [2019-11-20 09:46:40,294 WARN L191 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2019-11-20 09:46:41,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:46:41,182 INFO L93 Difference]: Finished difference Result 159 states and 174 transitions. [2019-11-20 09:46:41,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-20 09:46:41,183 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 37 [2019-11-20 09:46:41,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:46:41,184 INFO L225 Difference]: With dead ends: 159 [2019-11-20 09:46:41,184 INFO L226 Difference]: Without dead ends: 159 [2019-11-20 09:46:41,185 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 34.5s TimeCoverageRelationStatistics Valid=327, Invalid=2016, Unknown=9, NotChecked=0, Total=2352 [2019-11-20 09:46:41,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-20 09:46:41,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 108. [2019-11-20 09:46:41,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-20 09:46:41,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2019-11-20 09:46:41,189 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 37 [2019-11-20 09:46:41,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:46:41,189 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2019-11-20 09:46:41,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-20 09:46:41,190 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2019-11-20 09:46:41,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 09:46:41,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:46:41,191 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:46:41,393 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:46:41,393 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 09:46:41,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:46:41,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1059552774, now seen corresponding path program 1 times [2019-11-20 09:46:41,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:46:41,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [765444825] [2019-11-20 09:46:41,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0613eb54-c233-4d97-83c5-b67887bba5f7/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 09:46:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:46:41,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-20 09:46:41,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:46:41,622 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 09:46:41,622 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:46:41,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:46:41,626 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:46:41,627 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 09:46:41,648 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 09:46:41,648 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:46:41,657 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:46:41,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:46:41,657 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-20 09:46:41,682 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:46:41,682 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 09:46:41,682 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:46:41,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:46:41,693 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:46:41,693 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2019-11-20 09:46:41,710 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_40|], 2=[|v_#memory_int_40|]} [2019-11-20 09:46:41,715 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 09:46:41,716 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:46:41,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:46:41,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 09:46:41,744 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 09:46:41,744 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 09:46:41,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:46:41,759 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 09:46:41,759 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:29 [2019-11-20 09:46:41,785 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 20 treesize of output 8 [2019-11-20 09:46:41,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:46:41,793 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:46:41,794 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:46:41,794 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:22 [2019-11-20 09:46:41,837 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 09:46:41,837 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:46:41,848 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:46:41,849 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:46:41,849 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-11-20 09:46:41,890 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:46:41,891 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-20 09:46:41,891 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:46:41,903 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:46:41,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:46:41,904 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2019-11-20 09:46:41,933 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_41|], 6=[|v_#memory_int_42|]} [2019-11-20 09:46:41,946 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 09:46:41,946 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:46:41,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:46:41,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 09:46:41,989 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2019-11-20 09:46:41,989 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 09:46:42,006 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:46:42,007 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 09:46:42,007 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:34 [2019-11-20 09:46:42,054 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-20 09:46:42,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:46:42,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:46:42,067 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 09:46:42,067 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:28 [2019-11-20 09:46:42,170 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:46:42,170 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 1 case distinctions, treesize of input 28 treesize of output 54 [2019-11-20 09:46:42,170 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:46:42,219 INFO L567 ElimStorePlain]: treesize reduction 16, result has 72.9 percent of original size [2019-11-20 09:46:42,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:42,221 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 09:46:42,221 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:43 [2019-11-20 09:46:42,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:42,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:46:42,344 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 12 [2019-11-20 09:46:42,345 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:46:42,350 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:46:42,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:46:42,351 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2019-11-20 09:46:42,382 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:46:42,382 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:46:42,508 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 09:46:42,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:46:42,512 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 09:46:42,513 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:20 [2019-11-20 09:46:44,620 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-11-20 09:46:46,705 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-20 09:46:50,857 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-20 09:46:50,887 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:46:50,887 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 09:46:50,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:46:50,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:46:50,914 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 09:46:50,914 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:33 [2019-11-20 09:46:51,090 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 09:46:51,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:46:51,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 09:46:51,101 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:43 [2019-11-20 09:46:59,593 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 3002 treesize of output 2970 [2019-11-20 09:46:59,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-20 09:47:00,614 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 117 DAG size of output: 44 [2019-11-20 09:47:00,615 INFO L567 ElimStorePlain]: treesize reduction 2844, result has 2.4 percent of original size [2019-11-20 09:47:00,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:47:00,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:47:00,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:47:00,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-20 09:47:00,617 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:32 [2019-11-20 09:47:00,899 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:47:00,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [765444825] [2019-11-20 09:47:00,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 09:47:00,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 29 [2019-11-20 09:47:00,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585854202] [2019-11-20 09:47:00,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-20 09:47:00,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:47:00,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-20 09:47:00,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=679, Unknown=5, NotChecked=0, Total=812 [2019-11-20 09:47:00,901 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand 29 states. [2019-11-20 09:47:03,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:47:03,553 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-11-20 09:47:03,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-20 09:47:03,554 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 37 [2019-11-20 09:47:03,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:47:03,554 INFO L225 Difference]: With dead ends: 60 [2019-11-20 09:47:03,554 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 09:47:03,555 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=359, Invalid=1442, Unknown=5, NotChecked=0, Total=1806 [2019-11-20 09:47:03,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 09:47:03,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 09:47:03,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 09:47:03,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 09:47:03,556 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2019-11-20 09:47:03,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:47:03,556 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 09:47:03,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-20 09:47:03,556 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 09:47:03,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 09:47:03,757 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:47:03,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:47:03 BoogieIcfgContainer [2019-11-20 09:47:03,761 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 09:47:03,762 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 09:47:03,762 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 09:47:03,762 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 09:47:03,763 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:44:16" (3/4) ... [2019-11-20 09:47:03,766 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 09:47:03,771 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-20 09:47:03,771 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-11-20 09:47:03,771 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-20 09:47:03,771 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-20 09:47:03,771 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-20 09:47:03,771 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-20 09:47:03,771 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-20 09:47:03,772 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-20 09:47:03,777 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-20 09:47:03,778 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-20 09:47:03,778 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-20 09:47:03,779 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-20 09:47:03,828 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0613eb54-c233-4d97-83c5-b67887bba5f7/bin/uautomizer/witness.graphml [2019-11-20 09:47:03,828 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 09:47:03,830 INFO L168 Benchmark]: Toolchain (without parser) took 169592.54 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 255.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -155.8 MB). Peak memory consumption was 100.1 MB. Max. memory is 11.5 GB. [2019-11-20 09:47:03,830 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 09:47:03,831 INFO L168 Benchmark]: CACSL2BoogieTranslator took 676.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -163.6 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-20 09:47:03,831 INFO L168 Benchmark]: Boogie Preprocessor took 75.74 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 09:47:03,831 INFO L168 Benchmark]: RCFGBuilder took 1127.56 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: 56.6 MB). Peak memory consumption was 56.6 MB. Max. memory is 11.5 GB. [2019-11-20 09:47:03,832 INFO L168 Benchmark]: TraceAbstraction took 167641.67 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 121.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -61.5 MB). Peak memory consumption was 59.6 MB. Max. memory is 11.5 GB. [2019-11-20 09:47:03,832 INFO L168 Benchmark]: Witness Printer took 66.85 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. [2019-11-20 09:47:03,834 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 676.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -163.6 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.74 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 1127.56 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: 56.6 MB). Peak memory consumption was 56.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 167641.67 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 121.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -61.5 MB). Peak memory consumption was 59.6 MB. Max. memory is 11.5 GB. * Witness Printer took 66.85 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 539]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 539]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 536]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 537]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 537]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 531]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 531]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 536]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 560]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 557]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 557]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 560]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 29 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 95 locations, 29 error locations. Result: SAFE, OverallTime: 167.5s, OverallIterations: 14, TraceHistogramMax: 2, AutomataDifference: 31.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 631 SDtfs, 2259 SDslu, 2352 SDs, 0 SdLazy, 3027 SolverSat, 425 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 21.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 691 GetRequests, 468 SyntacticMatches, 12 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1141 ImplicationChecksByTransitivity, 66.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 367 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 129.9s InterpolantComputationTime, 313 NumberOfCodeBlocks, 313 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 598 ConstructedInterpolants, 63 QuantifiedInterpolants, 157643 SizeOfPredicates, 122 NumberOfNonLiveVariables, 1178 ConjunctsInSsa, 146 ConjunctsInUnsatCore, 28 InterpolantComputations, 22 PerfectInterpolantSequences, 34/74 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...