./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-bftpd/bftpd_3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 701f399f Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-bftpd/bftpd_3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b34e199f0da2018b0ae97fc3f9a24725315a1b16 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-701f399 [2019-11-22 10:13:36,155 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 10:13:36,158 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 10:13:36,175 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 10:13:36,176 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 10:13:36,178 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 10:13:36,180 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 10:13:36,193 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 10:13:36,196 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 10:13:36,198 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 10:13:36,200 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 10:13:36,202 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 10:13:36,202 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 10:13:36,206 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 10:13:36,208 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 10:13:36,210 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 10:13:36,212 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 10:13:36,214 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 10:13:36,217 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 10:13:36,219 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 10:13:36,220 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 10:13:36,221 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 10:13:36,223 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 10:13:36,224 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 10:13:36,226 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 10:13:36,226 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 10:13:36,226 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 10:13:36,227 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 10:13:36,228 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 10:13:36,229 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 10:13:36,229 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 10:13:36,230 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 10:13:36,231 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 10:13:36,232 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 10:13:36,233 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 10:13:36,233 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 10:13:36,234 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 10:13:36,234 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 10:13:36,234 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 10:13:36,235 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 10:13:36,236 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 10:13:36,237 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-22 10:13:36,252 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 10:13:36,252 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 10:13:36,254 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 10:13:36,254 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 10:13:36,254 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 10:13:36,255 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 10:13:36,255 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-22 10:13:36,255 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 10:13:36,255 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 10:13:36,256 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-22 10:13:36,256 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 10:13:36,256 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 10:13:36,257 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 10:13:36,257 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 10:13:36,257 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 10:13:36,257 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 10:13:36,258 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-22 10:13:36,258 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-22 10:13:36,258 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-22 10:13:36,259 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 10:13:36,259 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 10:13:36,259 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 10:13:36,259 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 10:13:36,260 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 10:13:36,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 10:13:36,260 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 10:13:36,261 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 10:13:36,261 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-22 10:13:36,261 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-22 10:13:36,262 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-22 10:13:36,262 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b34e199f0da2018b0ae97fc3f9a24725315a1b16 [2019-11-22 10:13:36,588 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 10:13:36,607 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 10:13:36,611 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 10:13:36,614 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 10:13:36,614 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 10:13:36,616 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2019-11-22 10:13:36,688 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5e2fb739/861e50d6757f4e71a34876d97d1657b3/FLAGd9a9cf867 [2019-11-22 10:13:37,257 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 10:13:37,261 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2019-11-22 10:13:37,285 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5e2fb739/861e50d6757f4e71a34876d97d1657b3/FLAGd9a9cf867 [2019-11-22 10:13:37,563 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5e2fb739/861e50d6757f4e71a34876d97d1657b3 [2019-11-22 10:13:37,566 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 10:13:37,568 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 10:13:37,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 10:13:37,569 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 10:13:37,573 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 10:13:37,574 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:13:37" (1/1) ... [2019-11-22 10:13:37,576 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76bb17a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:37, skipping insertion in model container [2019-11-22 10:13:37,577 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:13:37" (1/1) ... [2019-11-22 10:13:37,584 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 10:13:37,635 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-22 10:13:38,063 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 10:13:38,078 INFO L201 MainTranslator]: Completed pre-run [2019-11-22 10:13:38,134 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 10:13:38,235 INFO L205 MainTranslator]: Completed translation [2019-11-22 10:13:38,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:38 WrapperNode [2019-11-22 10:13:38,236 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 10:13:38,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 10:13:38,238 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 10:13:38,238 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 10:13:38,253 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:38" (1/1) ... [2019-11-22 10:13:38,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:38" (1/1) ... [2019-11-22 10:13:38,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:38" (1/1) ... [2019-11-22 10:13:38,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:38" (1/1) ... [2019-11-22 10:13:38,309 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:38" (1/1) ... [2019-11-22 10:13:38,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:38" (1/1) ... [2019-11-22 10:13:38,320 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:38" (1/1) ... [2019-11-22 10:13:38,329 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 10:13:38,330 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 10:13:38,330 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 10:13:38,330 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 10:13:38,331 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 10:13:38,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 10:13:38,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 10:13:38,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2019-11-22 10:13:38,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 10:13:38,401 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-22 10:13:38,401 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-22 10:13:38,401 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2019-11-22 10:13:38,402 INFO L138 BoogieDeclarations]: Found implementation of procedure c1 [2019-11-22 10:13:38,402 INFO L138 BoogieDeclarations]: Found implementation of procedure c2 [2019-11-22 10:13:38,402 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 10:13:38,402 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-22 10:13:38,403 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-22 10:13:38,403 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-22 10:13:38,403 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-22 10:13:38,403 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-22 10:13:38,404 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-22 10:13:38,404 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-22 10:13:38,404 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-22 10:13:38,404 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-22 10:13:38,404 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-22 10:13:38,405 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-22 10:13:38,405 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-22 10:13:38,405 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-22 10:13:38,405 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-22 10:13:38,405 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-22 10:13:38,406 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-22 10:13:38,406 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-22 10:13:38,406 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-22 10:13:38,406 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-22 10:13:38,407 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-22 10:13:38,407 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-22 10:13:38,407 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-22 10:13:38,407 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-22 10:13:38,407 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-22 10:13:38,408 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-22 10:13:38,408 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-22 10:13:38,408 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-22 10:13:38,408 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-22 10:13:38,408 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-22 10:13:38,408 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-22 10:13:38,409 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-22 10:13:38,409 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-22 10:13:38,409 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-22 10:13:38,409 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-22 10:13:38,409 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-22 10:13:38,410 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-22 10:13:38,410 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-22 10:13:38,410 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-22 10:13:38,410 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-22 10:13:38,410 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-22 10:13:38,411 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-22 10:13:38,411 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-22 10:13:38,411 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-22 10:13:38,411 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-22 10:13:38,412 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-22 10:13:38,412 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-22 10:13:38,412 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-22 10:13:38,412 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-22 10:13:38,413 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-22 10:13:38,413 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-22 10:13:38,413 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-22 10:13:38,413 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-22 10:13:38,413 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-22 10:13:38,414 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 10:13:38,414 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-22 10:13:38,414 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 10:13:38,414 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-22 10:13:38,414 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-22 10:13:38,415 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-22 10:13:38,415 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-22 10:13:38,415 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-22 10:13:38,415 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-22 10:13:38,416 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-22 10:13:38,416 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-22 10:13:38,416 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-22 10:13:38,416 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-22 10:13:38,416 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-22 10:13:38,417 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-22 10:13:38,417 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-22 10:13:38,417 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-22 10:13:38,417 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-22 10:13:38,417 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-22 10:13:38,418 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-22 10:13:38,418 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-22 10:13:38,418 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-22 10:13:38,418 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-22 10:13:38,419 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-22 10:13:38,419 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-22 10:13:38,419 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-22 10:13:38,419 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-22 10:13:38,419 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-22 10:13:38,420 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-22 10:13:38,420 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-22 10:13:38,420 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-22 10:13:38,420 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-22 10:13:38,420 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-22 10:13:38,421 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-22 10:13:38,421 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-22 10:13:38,421 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-22 10:13:38,421 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-22 10:13:38,421 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-22 10:13:38,422 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-22 10:13:38,422 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-22 10:13:38,422 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-22 10:13:38,422 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-22 10:13:38,422 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-22 10:13:38,423 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-22 10:13:38,423 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-22 10:13:38,423 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-22 10:13:38,423 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-22 10:13:38,423 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-22 10:13:38,424 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-22 10:13:38,424 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-22 10:13:38,424 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-22 10:13:38,424 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-22 10:13:38,424 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-22 10:13:38,425 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2019-11-22 10:13:38,425 INFO L130 BoogieDeclarations]: Found specification of procedure memccpy [2019-11-22 10:13:38,425 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-22 10:13:38,425 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-11-22 10:13:38,426 INFO L130 BoogieDeclarations]: Found specification of procedure memchr [2019-11-22 10:13:38,426 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2019-11-22 10:13:38,426 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-11-22 10:13:38,426 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2019-11-22 10:13:38,426 INFO L130 BoogieDeclarations]: Found specification of procedure strncat [2019-11-22 10:13:38,427 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2019-11-22 10:13:38,427 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2019-11-22 10:13:38,427 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll [2019-11-22 10:13:38,427 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm [2019-11-22 10:13:38,427 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll_l [2019-11-22 10:13:38,428 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm_l [2019-11-22 10:13:38,428 INFO L130 BoogieDeclarations]: Found specification of procedure strdup [2019-11-22 10:13:38,428 INFO L130 BoogieDeclarations]: Found specification of procedure strndup [2019-11-22 10:13:38,428 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2019-11-22 10:13:38,428 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2019-11-22 10:13:38,429 INFO L130 BoogieDeclarations]: Found specification of procedure strcspn [2019-11-22 10:13:38,429 INFO L130 BoogieDeclarations]: Found specification of procedure strspn [2019-11-22 10:13:38,429 INFO L130 BoogieDeclarations]: Found specification of procedure strpbrk [2019-11-22 10:13:38,429 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2019-11-22 10:13:38,430 INFO L130 BoogieDeclarations]: Found specification of procedure strtok [2019-11-22 10:13:38,430 INFO L130 BoogieDeclarations]: Found specification of procedure __strtok_r [2019-11-22 10:13:38,430 INFO L130 BoogieDeclarations]: Found specification of procedure strtok_r [2019-11-22 10:13:38,430 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-11-22 10:13:38,430 INFO L130 BoogieDeclarations]: Found specification of procedure strnlen [2019-11-22 10:13:38,431 INFO L130 BoogieDeclarations]: Found specification of procedure strerror [2019-11-22 10:13:38,431 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_r [2019-11-22 10:13:38,431 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_l [2019-11-22 10:13:38,431 INFO L130 BoogieDeclarations]: Found specification of procedure __bzero [2019-11-22 10:13:38,431 INFO L130 BoogieDeclarations]: Found specification of procedure bcopy [2019-11-22 10:13:38,432 INFO L130 BoogieDeclarations]: Found specification of procedure bzero [2019-11-22 10:13:38,432 INFO L130 BoogieDeclarations]: Found specification of procedure bcmp [2019-11-22 10:13:38,432 INFO L130 BoogieDeclarations]: Found specification of procedure index [2019-11-22 10:13:38,432 INFO L130 BoogieDeclarations]: Found specification of procedure rindex [2019-11-22 10:13:38,432 INFO L130 BoogieDeclarations]: Found specification of procedure ffs [2019-11-22 10:13:38,433 INFO L130 BoogieDeclarations]: Found specification of procedure strcasecmp [2019-11-22 10:13:38,433 INFO L130 BoogieDeclarations]: Found specification of procedure strncasecmp [2019-11-22 10:13:38,433 INFO L130 BoogieDeclarations]: Found specification of procedure strsep [2019-11-22 10:13:38,433 INFO L130 BoogieDeclarations]: Found specification of procedure strsignal [2019-11-22 10:13:38,433 INFO L130 BoogieDeclarations]: Found specification of procedure __stpcpy [2019-11-22 10:13:38,434 INFO L130 BoogieDeclarations]: Found specification of procedure stpcpy [2019-11-22 10:13:38,434 INFO L130 BoogieDeclarations]: Found specification of procedure __stpncpy [2019-11-22 10:13:38,434 INFO L130 BoogieDeclarations]: Found specification of procedure stpncpy [2019-11-22 10:13:38,434 INFO L130 BoogieDeclarations]: Found specification of procedure c1 [2019-11-22 10:13:38,434 INFO L130 BoogieDeclarations]: Found specification of procedure c2 [2019-11-22 10:13:38,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-22 10:13:38,435 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2019-11-22 10:13:38,435 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2019-11-22 10:13:38,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-22 10:13:38,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-11-22 10:13:38,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 10:13:38,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 10:13:38,436 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 10:13:38,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 10:13:38,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2019-11-22 10:13:38,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-22 10:13:38,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 10:13:38,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 10:13:38,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-22 10:13:38,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-11-22 10:13:39,257 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 10:13:39,258 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-22 10:13:39,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:13:39 BoogieIcfgContainer [2019-11-22 10:13:39,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 10:13:39,260 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 10:13:39,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 10:13:39,264 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 10:13:39,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:13:37" (1/3) ... [2019-11-22 10:13:39,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1266fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:13:39, skipping insertion in model container [2019-11-22 10:13:39,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:38" (2/3) ... [2019-11-22 10:13:39,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1266fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:13:39, skipping insertion in model container [2019-11-22 10:13:39,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:13:39" (3/3) ... [2019-11-22 10:13:39,268 INFO L109 eAbstractionObserver]: Analyzing ICFG bftpd_3.i [2019-11-22 10:13:39,278 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 10:13:39,287 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-11-22 10:13:39,298 INFO L249 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-11-22 10:13:39,320 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 10:13:39,321 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 10:13:39,321 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 10:13:39,321 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 10:13:39,322 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 10:13:39,322 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 10:13:39,322 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 10:13:39,322 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 10:13:39,342 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2019-11-22 10:13:39,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 10:13:39,352 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:13:39,353 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:13:39,354 INFO L410 AbstractCegarLoop]: === Iteration 1 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:13:39,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:13:39,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1137100954, now seen corresponding path program 1 times [2019-11-22 10:13:39,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:13:39,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1002169074] [2019-11-22 10:13:39,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:13:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:13:39,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-22 10:13:39,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:13:40,233 WARN L192 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 33 [2019-11-22 10:13:40,236 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-22 10:13:40,237 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 24 treesize of output 65 [2019-11-22 10:13:40,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:40,344 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-11-22 10:13:40,345 INFO L567 ElimStorePlain]: treesize reduction 10, result has 84.6 percent of original size [2019-11-22 10:13:40,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:13:40,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 10:13:40,372 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:24, output treesize:55 [2019-11-22 10:13:40,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:13:40,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:13:40,423 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:13:40,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:13:40,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1002169074] [2019-11-22 10:13:40,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:13:40,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-22 10:13:40,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934592688] [2019-11-22 10:13:40,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 10:13:40,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:13:40,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 10:13:40,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 10:13:40,493 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2019-11-22 10:13:40,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:13:40,671 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2019-11-22 10:13:40,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 10:13:40,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-22 10:13:40,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:13:40,687 INFO L225 Difference]: With dead ends: 88 [2019-11-22 10:13:40,687 INFO L226 Difference]: Without dead ends: 82 [2019-11-22 10:13:40,691 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 10:13:40,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-22 10:13:40,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2019-11-22 10:13:40,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-22 10:13:40,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2019-11-22 10:13:40,771 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 9 [2019-11-22 10:13:40,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:13:40,772 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2019-11-22 10:13:40,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 10:13:40,773 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2019-11-22 10:13:40,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 10:13:40,774 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:13:40,774 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:13:40,980 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:13:40,984 INFO L410 AbstractCegarLoop]: === Iteration 2 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:13:40,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:13:40,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1137100953, now seen corresponding path program 1 times [2019-11-22 10:13:40,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:13:40,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [979763948] [2019-11-22 10:13:40,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:13:41,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:13:41,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-22 10:13:41,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:13:41,723 WARN L192 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-22 10:13:41,725 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-22 10:13:41,725 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2019-11-22 10:13:41,726 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:41,880 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2019-11-22 10:13:41,881 INFO L567 ElimStorePlain]: treesize reduction 50, result has 51.9 percent of original size [2019-11-22 10:13:41,884 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:13:41,884 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:9 [2019-11-22 10:13:41,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-22 10:13:41,920 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:13:42,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:13:42,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [979763948] [2019-11-22 10:13:42,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:13:42,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-22 10:13:42,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407346508] [2019-11-22 10:13:42,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 10:13:42,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:13:42,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 10:13:42,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-22 10:13:42,155 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand 6 states. [2019-11-22 10:13:42,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:13:42,844 INFO L93 Difference]: Finished difference Result 164 states and 208 transitions. [2019-11-22 10:13:42,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 10:13:42,845 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-11-22 10:13:42,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:13:42,847 INFO L225 Difference]: With dead ends: 164 [2019-11-22 10:13:42,848 INFO L226 Difference]: Without dead ends: 164 [2019-11-22 10:13:42,849 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-22 10:13:42,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-22 10:13:42,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 132. [2019-11-22 10:13:42,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-22 10:13:42,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 187 transitions. [2019-11-22 10:13:42,874 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 187 transitions. Word has length 9 [2019-11-22 10:13:42,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:13:42,875 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 187 transitions. [2019-11-22 10:13:42,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 10:13:42,875 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 187 transitions. [2019-11-22 10:13:42,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 10:13:42,876 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:13:42,876 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:13:43,080 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:13:43,081 INFO L410 AbstractCegarLoop]: === Iteration 3 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:13:43,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:13:43,082 INFO L82 PathProgramCache]: Analyzing trace with hash -890391164, now seen corresponding path program 1 times [2019-11-22 10:13:43,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:13:43,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1958154890] [2019-11-22 10:13:43,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:13:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:13:43,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-22 10:13:43,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:13:44,015 WARN L192 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 66 [2019-11-22 10:13:44,017 INFO L343 Elim1Store]: treesize reduction 591, result has 19.8 percent of original size [2019-11-22 10:13:44,018 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 15 case distinctions, treesize of input 289 treesize of output 391 [2019-11-22 10:13:44,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:44,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:45,101 WARN L192 SmtUtils]: Spent 905.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 66 [2019-11-22 10:13:45,103 INFO L567 ElimStorePlain]: treesize reduction 5712, result has 2.8 percent of original size [2019-11-22 10:13:45,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:13:45,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 10:13:45,111 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:146, output treesize:166 [2019-11-22 10:13:45,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:13:45,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:13:45,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:13:45,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:13:45,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:13:45,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:13:45,699 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 61 [2019-11-22 10:13:45,743 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 46 [2019-11-22 10:13:45,745 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 10:13:45,895 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-11-22 10:13:45,896 INFO L567 ElimStorePlain]: treesize reduction 5, result has 94.2 percent of original size [2019-11-22 10:13:45,897 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-22 10:13:45,898 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:135, output treesize:81 [2019-11-22 10:13:45,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:13:45,947 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:13:46,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:13:46,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1958154890] [2019-11-22 10:13:46,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:13:46,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-22 10:13:46,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490564909] [2019-11-22 10:13:46,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 10:13:46,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:13:46,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 10:13:46,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-22 10:13:46,297 INFO L87 Difference]: Start difference. First operand 132 states and 187 transitions. Second operand 8 states. [2019-11-22 10:13:46,592 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-11-22 10:13:46,937 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-11-22 10:13:47,724 WARN L192 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 78 [2019-11-22 10:13:48,913 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2019-11-22 10:13:49,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:13:49,638 INFO L93 Difference]: Finished difference Result 277 states and 397 transitions. [2019-11-22 10:13:49,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 10:13:49,639 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-11-22 10:13:49,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:13:49,643 INFO L225 Difference]: With dead ends: 277 [2019-11-22 10:13:49,643 INFO L226 Difference]: Without dead ends: 277 [2019-11-22 10:13:49,644 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-11-22 10:13:49,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-11-22 10:13:49,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 205. [2019-11-22 10:13:49,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-11-22 10:13:49,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 306 transitions. [2019-11-22 10:13:49,673 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 306 transitions. Word has length 10 [2019-11-22 10:13:49,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:13:49,673 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 306 transitions. [2019-11-22 10:13:49,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 10:13:49,674 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 306 transitions. [2019-11-22 10:13:49,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-22 10:13:49,674 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:13:49,674 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:13:49,877 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:13:49,878 INFO L410 AbstractCegarLoop]: === Iteration 4 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:13:49,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:13:49,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1832322202, now seen corresponding path program 1 times [2019-11-22 10:13:49,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:13:49,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1833529141] [2019-11-22 10:13:49,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:13:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:13:50,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-22 10:13:50,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:13:50,398 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_52|], 12=[|v_#valid_69|]} [2019-11-22 10:13:50,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:50,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:50,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:50,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:50,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:50,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:50,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:50,739 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-11-22 10:13:50,741 INFO L343 Elim1Store]: treesize reduction 72, result has 65.4 percent of original size [2019-11-22 10:13:50,741 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 141 [2019-11-22 10:13:50,742 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:51,010 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-11-22 10:13:51,011 INFO L567 ElimStorePlain]: treesize reduction 70, result has 71.2 percent of original size [2019-11-22 10:13:51,081 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:13:51,082 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 420 treesize of output 428 [2019-11-22 10:13:51,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,168 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:51,822 WARN L192 SmtUtils]: Spent 653.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 69 [2019-11-22 10:13:51,823 INFO L567 ElimStorePlain]: treesize reduction 6254, result has 2.4 percent of original size [2019-11-22 10:13:51,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,827 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 10:13:51,827 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:134, output treesize:155 [2019-11-22 10:13:51,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:51,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:52,013 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 10:13:52,015 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 112 [2019-11-22 10:13:52,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:52,048 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 109 [2019-11-22 10:13:52,049 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:52,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:52,076 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 114 [2019-11-22 10:13:52,076 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:52,112 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:13:52,113 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 126 [2019-11-22 10:13:52,114 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:52,123 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 10:13:52,123 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:52,133 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 10:13:52,133 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:52,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:52,160 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 117 [2019-11-22 10:13:52,161 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:52,171 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 10:13:52,172 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:52,183 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 10:13:52,183 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:52,208 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 109 [2019-11-22 10:13:52,209 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:52,217 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 10:13:52,218 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:52,225 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 10:13:52,225 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:52,672 WARN L192 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-11-22 10:13:52,673 INFO L567 ElimStorePlain]: treesize reduction 337, result has 47.9 percent of original size [2019-11-22 10:13:52,675 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2019-11-22 10:13:52,676 INFO L221 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:1515, output treesize:310 [2019-11-22 10:13:52,983 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-11-22 10:13:53,272 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-22 10:13:53,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:13:53,304 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 79 treesize of output 59 [2019-11-22 10:13:53,305 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:53,522 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-11-22 10:13:53,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:13:53,544 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 51 treesize of output 43 [2019-11-22 10:13:53,545 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:53,712 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-22 10:13:53,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:13:53,732 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 79 treesize of output 59 [2019-11-22 10:13:53,733 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 10:13:53,891 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-22 10:13:53,892 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:13:53,905 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 84 treesize of output 76 [2019-11-22 10:13:53,906 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:54,037 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-22 10:13:54,038 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:13:54,056 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 56 treesize of output 48 [2019-11-22 10:13:54,057 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:54,187 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-22 10:13:54,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:13:54,198 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 73 treesize of output 45 [2019-11-22 10:13:54,200 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 10:13:54,324 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-22 10:13:54,325 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:13:54,328 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 6 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-11-22 10:13:54,328 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 14 variables, input treesize:243, output treesize:121 [2019-11-22 10:13:54,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:13:54,519 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:13:54,824 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-22 10:13:54,933 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-22 10:13:55,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:13:55,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1833529141] [2019-11-22 10:13:55,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:13:55,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2019-11-22 10:13:55,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167345100] [2019-11-22 10:13:55,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-22 10:13:55,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:13:55,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-22 10:13:55,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-22 10:13:55,103 INFO L87 Difference]: Start difference. First operand 205 states and 306 transitions. Second operand 9 states. [2019-11-22 10:13:55,550 WARN L192 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 80 [2019-11-22 10:13:56,091 WARN L192 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 99 [2019-11-22 10:13:58,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:13:58,284 INFO L93 Difference]: Finished difference Result 355 states and 474 transitions. [2019-11-22 10:13:58,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 10:13:58,286 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2019-11-22 10:13:58,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:13:58,289 INFO L225 Difference]: With dead ends: 355 [2019-11-22 10:13:58,289 INFO L226 Difference]: Without dead ends: 355 [2019-11-22 10:13:58,290 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-11-22 10:13:58,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-11-22 10:13:58,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 290. [2019-11-22 10:13:58,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-11-22 10:13:58,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 436 transitions. [2019-11-22 10:13:58,336 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 436 transitions. Word has length 11 [2019-11-22 10:13:58,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:13:58,336 INFO L462 AbstractCegarLoop]: Abstraction has 290 states and 436 transitions. [2019-11-22 10:13:58,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-22 10:13:58,336 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 436 transitions. [2019-11-22 10:13:58,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-22 10:13:58,337 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:13:58,337 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:13:58,541 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:13:58,542 INFO L410 AbstractCegarLoop]: === Iteration 5 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:13:58,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:13:58,543 INFO L82 PathProgramCache]: Analyzing trace with hash -967413306, now seen corresponding path program 1 times [2019-11-22 10:13:58,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:13:58,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [198360103] [2019-11-22 10:13:58,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:13:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:13:58,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 10:13:58,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:13:59,272 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 48 [2019-11-22 10:13:59,273 INFO L343 Elim1Store]: treesize reduction 355, result has 19.1 percent of original size [2019-11-22 10:13:59,274 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 1568 treesize of output 1562 [2019-11-22 10:13:59,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:59,809 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:01,824 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 467 DAG size of output: 63 [2019-11-22 10:14:01,825 INFO L567 ElimStorePlain]: treesize reduction 57892, result has 0.2 percent of original size [2019-11-22 10:14:01,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:14:01,828 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 10:14:01,828 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:85, output treesize:103 [2019-11-22 10:14:01,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:14:01,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:14:01,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:14:02,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:14:02,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:14:02,308 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 51 [2019-11-22 10:14:02,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:02,473 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:14:02,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:02,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [198360103] [2019-11-22 10:14:02,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:14:02,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-22 10:14:02,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883372444] [2019-11-22 10:14:02,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 10:14:02,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:14:02,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 10:14:02,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-22 10:14:02,701 INFO L87 Difference]: Start difference. First operand 290 states and 436 transitions. Second operand 10 states. [2019-11-22 10:14:03,815 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-11-22 10:14:05,268 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-11-22 10:14:06,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:14:06,282 INFO L93 Difference]: Finished difference Result 373 states and 521 transitions. [2019-11-22 10:14:06,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 10:14:06,284 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-11-22 10:14:06,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:14:06,293 INFO L225 Difference]: With dead ends: 373 [2019-11-22 10:14:06,293 INFO L226 Difference]: Without dead ends: 373 [2019-11-22 10:14:06,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-22 10:14:06,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-11-22 10:14:06,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 313. [2019-11-22 10:14:06,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-11-22 10:14:06,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 458 transitions. [2019-11-22 10:14:06,321 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 458 transitions. Word has length 12 [2019-11-22 10:14:06,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:14:06,321 INFO L462 AbstractCegarLoop]: Abstraction has 313 states and 458 transitions. [2019-11-22 10:14:06,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 10:14:06,322 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 458 transitions. [2019-11-22 10:14:06,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-22 10:14:06,322 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:14:06,322 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:14:06,525 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:06,527 INFO L410 AbstractCegarLoop]: === Iteration 6 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:14:06,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:14:06,527 INFO L82 PathProgramCache]: Analyzing trace with hash 74958696, now seen corresponding path program 1 times [2019-11-22 10:14:06,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:14:06,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1436863022] [2019-11-22 10:14:06,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:14:07,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-22 10:14:07,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:14:07,054 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_65|], 18=[|v_#valid_85|]} [2019-11-22 10:14:07,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:14:07,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:14:07,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:14:07,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:14:07,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:14:07,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:14:07,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:14:07,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:14:07,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:14:07,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:14:07,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:14:07,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:14:07,135 INFO L343 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2019-11-22 10:14:07,136 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 31 [2019-11-22 10:14:07,136 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:07,198 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:07,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:14:07,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:14:07,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:14:07,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:14:07,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:14:07,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:14:07,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:14:07,250 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:07,250 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 158 [2019-11-22 10:14:07,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:07,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:07,253 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:07,435 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 40 [2019-11-22 10:14:07,435 INFO L567 ElimStorePlain]: treesize reduction 273, result has 18.5 percent of original size [2019-11-22 10:14:07,436 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 10:14:07,436 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:85, output treesize:62 [2019-11-22 10:14:07,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:07,691 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:14:08,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:08,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1436863022] [2019-11-22 10:14:08,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:14:08,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-22 10:14:08,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371829564] [2019-11-22 10:14:08,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 10:14:08,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:14:08,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 10:14:08,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-22 10:14:08,067 INFO L87 Difference]: Start difference. First operand 313 states and 458 transitions. Second operand 8 states. [2019-11-22 10:14:08,385 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-11-22 10:14:09,187 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-11-22 10:14:10,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:14:10,342 INFO L93 Difference]: Finished difference Result 372 states and 471 transitions. [2019-11-22 10:14:10,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 10:14:10,344 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-11-22 10:14:10,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:14:10,347 INFO L225 Difference]: With dead ends: 372 [2019-11-22 10:14:10,348 INFO L226 Difference]: Without dead ends: 372 [2019-11-22 10:14:10,348 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-22 10:14:10,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-11-22 10:14:10,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 314. [2019-11-22 10:14:10,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-11-22 10:14:10,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 453 transitions. [2019-11-22 10:14:10,365 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 453 transitions. Word has length 13 [2019-11-22 10:14:10,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:14:10,366 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 453 transitions. [2019-11-22 10:14:10,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 10:14:10,366 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 453 transitions. [2019-11-22 10:14:10,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 10:14:10,367 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:14:10,368 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:14:10,572 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:10,572 INFO L410 AbstractCegarLoop]: === Iteration 7 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:14:10,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:14:10,572 INFO L82 PathProgramCache]: Analyzing trace with hash -456233619, now seen corresponding path program 1 times [2019-11-22 10:14:10,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:14:10,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1853618854] [2019-11-22 10:14:10,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:14:11,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-22 10:14:11,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:14:11,151 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_73|], 9=[|v_#valid_93|]} [2019-11-22 10:14:11,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:14:11,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:14:11,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:14:11,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:14:11,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:14:11,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:14:11,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:14:11,463 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-11-22 10:14:11,464 INFO L343 Elim1Store]: treesize reduction 63, result has 65.6 percent of original size [2019-11-22 10:14:11,465 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 125 [2019-11-22 10:14:11,465 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:11,685 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-11-22 10:14:11,686 INFO L567 ElimStorePlain]: treesize reduction 62, result has 70.9 percent of original size [2019-11-22 10:14:11,727 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:11,728 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 204 treesize of output 206 [2019-11-22 10:14:11,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:11,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:11,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:11,732 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:12,148 WARN L192 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 70 [2019-11-22 10:14:12,149 INFO L567 ElimStorePlain]: treesize reduction 585, result has 19.4 percent of original size [2019-11-22 10:14:12,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,159 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 10:14:12,160 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:116, output treesize:141 [2019-11-22 10:14:12,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:12,370 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 10:14:12,380 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:12,381 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 110 [2019-11-22 10:14:12,381 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:12,419 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 83 [2019-11-22 10:14:12,420 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:12,432 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 10:14:12,432 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:12,440 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 10:14:12,441 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:12,455 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 10:14:12,455 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:12,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:14:12,493 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 83 [2019-11-22 10:14:12,494 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:12,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:14:12,526 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 92 [2019-11-22 10:14:12,527 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:12,537 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 10:14:12,537 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:12,577 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 10:14:12,578 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 10:14:12,579 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 92 [2019-11-22 10:14:12,580 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:12,599 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 10:14:12,601 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 10:14:12,602 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 81 [2019-11-22 10:14:12,603 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:12,616 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 10:14:12,616 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:13,093 WARN L192 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2019-11-22 10:14:13,096 INFO L567 ElimStorePlain]: treesize reduction 249, result has 50.8 percent of original size [2019-11-22 10:14:13,098 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2019-11-22 10:14:13,099 INFO L221 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:1252, output treesize:257 [2019-11-22 10:14:13,277 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 54 [2019-11-22 10:14:13,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:13,633 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 55 [2019-11-22 10:14:13,633 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:13,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:13,731 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 62 treesize of output 50 [2019-11-22 10:14:13,731 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:13,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:13,818 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 49 treesize of output 41 [2019-11-22 10:14:13,818 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:13,880 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:13,886 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2019-11-22 10:14:13,886 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:13,945 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:13,946 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-11-22 10:14:13,947 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:126, output treesize:75 [2019-11-22 10:14:14,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:14,025 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:14:14,333 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-22 10:14:14,616 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:14,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1853618854] [2019-11-22 10:14:14,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 10:14:14,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2019-11-22 10:14:14,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941777198] [2019-11-22 10:14:14,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-22 10:14:14,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:14:14,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-22 10:14:14,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-22 10:14:14,618 INFO L87 Difference]: Start difference. First operand 314 states and 453 transitions. Second operand 11 states. [2019-11-22 10:14:14,998 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-11-22 10:14:15,417 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-11-22 10:14:15,707 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-11-22 10:14:16,324 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 92 [2019-11-22 10:14:19,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:14:19,369 INFO L93 Difference]: Finished difference Result 442 states and 590 transitions. [2019-11-22 10:14:19,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-22 10:14:19,375 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-11-22 10:14:19,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:14:19,378 INFO L225 Difference]: With dead ends: 442 [2019-11-22 10:14:19,378 INFO L226 Difference]: Without dead ends: 442 [2019-11-22 10:14:19,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2019-11-22 10:14:19,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-11-22 10:14:19,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 343. [2019-11-22 10:14:19,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-11-22 10:14:19,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 492 transitions. [2019-11-22 10:14:19,408 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 492 transitions. Word has length 19 [2019-11-22 10:14:19,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:14:19,409 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 492 transitions. [2019-11-22 10:14:19,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-22 10:14:19,409 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 492 transitions. [2019-11-22 10:14:19,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-22 10:14:19,411 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:14:19,411 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:14:19,617 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:19,617 INFO L410 AbstractCegarLoop]: === Iteration 8 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:14:19,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:14:19,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1646602239, now seen corresponding path program 1 times [2019-11-22 10:14:19,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:14:19,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [291279613] [2019-11-22 10:14:19,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:19,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:14:19,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-22 10:14:19,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:14:19,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:19,873 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:14:19,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:19,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [291279613] [2019-11-22 10:14:19,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:14:19,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-22 10:14:19,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233769426] [2019-11-22 10:14:19,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 10:14:19,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:14:19,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 10:14:19,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 10:14:19,885 INFO L87 Difference]: Start difference. First operand 343 states and 492 transitions. Second operand 3 states. [2019-11-22 10:14:19,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:14:19,911 INFO L93 Difference]: Finished difference Result 504 states and 738 transitions. [2019-11-22 10:14:19,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 10:14:19,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-22 10:14:19,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:14:19,915 INFO L225 Difference]: With dead ends: 504 [2019-11-22 10:14:19,916 INFO L226 Difference]: Without dead ends: 504 [2019-11-22 10:14:19,916 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 10:14:19,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-11-22 10:14:19,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 487. [2019-11-22 10:14:19,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-11-22 10:14:19,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 730 transitions. [2019-11-22 10:14:19,943 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 730 transitions. Word has length 23 [2019-11-22 10:14:19,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:14:19,943 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 730 transitions. [2019-11-22 10:14:19,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 10:14:19,944 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 730 transitions. [2019-11-22 10:14:19,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-22 10:14:19,945 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:14:19,945 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:14:20,157 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:20,157 INFO L410 AbstractCegarLoop]: === Iteration 9 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:14:20,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:14:20,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1646602463, now seen corresponding path program 1 times [2019-11-22 10:14:20,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:14:20,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [70976494] [2019-11-22 10:14:20,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:14:20,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-22 10:14:20,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:14:20,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:20,422 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:14:20,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:20,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [70976494] [2019-11-22 10:14:20,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:14:20,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-22 10:14:20,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786287697] [2019-11-22 10:14:20,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 10:14:20,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:14:20,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 10:14:20,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 10:14:20,431 INFO L87 Difference]: Start difference. First operand 487 states and 730 transitions. Second operand 3 states. [2019-11-22 10:14:20,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:14:20,437 INFO L93 Difference]: Finished difference Result 455 states and 676 transitions. [2019-11-22 10:14:20,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 10:14:20,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-22 10:14:20,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:14:20,441 INFO L225 Difference]: With dead ends: 455 [2019-11-22 10:14:20,442 INFO L226 Difference]: Without dead ends: 455 [2019-11-22 10:14:20,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 10:14:20,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-11-22 10:14:20,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2019-11-22 10:14:20,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-11-22 10:14:20,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 676 transitions. [2019-11-22 10:14:20,467 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 676 transitions. Word has length 23 [2019-11-22 10:14:20,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:14:20,470 INFO L462 AbstractCegarLoop]: Abstraction has 455 states and 676 transitions. [2019-11-22 10:14:20,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 10:14:20,470 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 676 transitions. [2019-11-22 10:14:20,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-22 10:14:20,472 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:14:20,472 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:14:20,675 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:20,676 INFO L410 AbstractCegarLoop]: === Iteration 10 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:14:20,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:14:20,676 INFO L82 PathProgramCache]: Analyzing trace with hash -494938069, now seen corresponding path program 1 times [2019-11-22 10:14:20,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:14:20,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2030478530] [2019-11-22 10:14:20,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:14:20,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-22 10:14:20,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:14:20,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:20,933 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:14:20,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:20,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2030478530] [2019-11-22 10:14:20,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:14:20,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-22 10:14:20,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307329403] [2019-11-22 10:14:20,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 10:14:20,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:14:20,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 10:14:20,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 10:14:20,968 INFO L87 Difference]: Start difference. First operand 455 states and 676 transitions. Second operand 4 states. [2019-11-22 10:14:21,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:14:21,112 INFO L93 Difference]: Finished difference Result 546 states and 773 transitions. [2019-11-22 10:14:21,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 10:14:21,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-22 10:14:21,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:14:21,117 INFO L225 Difference]: With dead ends: 546 [2019-11-22 10:14:21,118 INFO L226 Difference]: Without dead ends: 546 [2019-11-22 10:14:21,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 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-22 10:14:21,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-11-22 10:14:21,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 515. [2019-11-22 10:14:21,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-11-22 10:14:21,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 756 transitions. [2019-11-22 10:14:21,139 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 756 transitions. Word has length 24 [2019-11-22 10:14:21,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:14:21,139 INFO L462 AbstractCegarLoop]: Abstraction has 515 states and 756 transitions. [2019-11-22 10:14:21,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 10:14:21,140 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 756 transitions. [2019-11-22 10:14:21,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-22 10:14:21,141 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:14:21,141 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:14:21,344 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:21,345 INFO L410 AbstractCegarLoop]: === Iteration 11 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:14:21,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:14:21,346 INFO L82 PathProgramCache]: Analyzing trace with hash -567996427, now seen corresponding path program 1 times [2019-11-22 10:14:21,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:14:21,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2111030058] [2019-11-22 10:14:21,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:14:21,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 10:14:21,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:14:21,711 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:21,712 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:14:21,772 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:21,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2111030058] [2019-11-22 10:14:21,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 10:14:21,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-22 10:14:21,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804246692] [2019-11-22 10:14:21,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 10:14:21,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:14:21,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 10:14:21,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-22 10:14:21,775 INFO L87 Difference]: Start difference. First operand 515 states and 756 transitions. Second operand 8 states. [2019-11-22 10:14:21,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:14:21,938 INFO L93 Difference]: Finished difference Result 535 states and 764 transitions. [2019-11-22 10:14:21,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 10:14:21,938 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-11-22 10:14:21,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:14:21,941 INFO L225 Difference]: With dead ends: 535 [2019-11-22 10:14:21,942 INFO L226 Difference]: Without dead ends: 535 [2019-11-22 10:14:21,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-22 10:14:21,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-11-22 10:14:21,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 462. [2019-11-22 10:14:21,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2019-11-22 10:14:21,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 634 transitions. [2019-11-22 10:14:21,965 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 634 transitions. Word has length 25 [2019-11-22 10:14:21,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:14:21,966 INFO L462 AbstractCegarLoop]: Abstraction has 462 states and 634 transitions. [2019-11-22 10:14:21,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 10:14:21,966 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 634 transitions. [2019-11-22 10:14:21,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-22 10:14:21,971 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:14:21,972 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:14:22,176 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:22,177 INFO L410 AbstractCegarLoop]: === Iteration 12 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:14:22,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:14:22,177 INFO L82 PathProgramCache]: Analyzing trace with hash -71787967, now seen corresponding path program 1 times [2019-11-22 10:14:22,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:14:22,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1665591880] [2019-11-22 10:14:22,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:22,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:14:22,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-22 10:14:22,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:14:22,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:22,451 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:14:22,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:22,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1665591880] [2019-11-22 10:14:22,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:14:22,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-22 10:14:22,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626285997] [2019-11-22 10:14:22,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 10:14:22,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:14:22,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 10:14:22,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 10:14:22,503 INFO L87 Difference]: Start difference. First operand 462 states and 634 transitions. Second operand 3 states. [2019-11-22 10:14:22,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:14:22,511 INFO L93 Difference]: Finished difference Result 312 states and 412 transitions. [2019-11-22 10:14:22,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 10:14:22,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-22 10:14:22,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:14:22,514 INFO L225 Difference]: With dead ends: 312 [2019-11-22 10:14:22,515 INFO L226 Difference]: Without dead ends: 312 [2019-11-22 10:14:22,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 10:14:22,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-11-22 10:14:22,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 309. [2019-11-22 10:14:22,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-11-22 10:14:22,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 408 transitions. [2019-11-22 10:14:22,525 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 408 transitions. Word has length 33 [2019-11-22 10:14:22,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:14:22,525 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 408 transitions. [2019-11-22 10:14:22,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 10:14:22,526 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 408 transitions. [2019-11-22 10:14:22,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-22 10:14:22,530 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:14:22,530 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:14:22,734 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:22,735 INFO L410 AbstractCegarLoop]: === Iteration 13 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:14:22,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:14:22,736 INFO L82 PathProgramCache]: Analyzing trace with hash -245427548, now seen corresponding path program 1 times [2019-11-22 10:14:22,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:14:22,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [281242489] [2019-11-22 10:14:22,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:14:23,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 10:14:23,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:14:23,607 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 33 [2019-11-22 10:14:23,608 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-22 10:14:23,608 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 72 treesize of output 110 [2019-11-22 10:14:23,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:23,733 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-11-22 10:14:23,734 INFO L567 ElimStorePlain]: treesize reduction 36, result has 66.4 percent of original size [2019-11-22 10:14:23,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:14:23,736 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 10:14:23,736 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:71 [2019-11-22 10:14:23,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:14:23,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:14:23,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:14:23,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:14:24,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:14:24,242 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:24,243 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 60 treesize of output 136 [2019-11-22 10:14:24,244 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:24,398 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:24,398 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 58 treesize of output 134 [2019-11-22 10:14:24,399 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:24,620 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-22 10:14:24,621 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:24,621 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 60 treesize of output 136 [2019-11-22 10:14:24,622 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:24,632 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 10:14:24,633 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:24,639 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 10:14:24,639 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:24,645 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 10:14:24,646 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:24,781 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-22 10:14:24,781 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:24,782 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 58 treesize of output 134 [2019-11-22 10:14:24,783 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:24,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:24,847 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-22 10:14:24,847 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:422, output treesize:12 [2019-11-22 10:14:24,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:14:25,037 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 31 [2019-11-22 10:14:25,125 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-22 10:14:25,126 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:14:25,425 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-22 10:14:25,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [281242489] [2019-11-22 10:14:25,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 10:14:25,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2019-11-22 10:14:25,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864559769] [2019-11-22 10:14:25,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-22 10:14:25,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:14:25,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-22 10:14:25,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-22 10:14:25,428 INFO L87 Difference]: Start difference. First operand 309 states and 408 transitions. Second operand 14 states. [2019-11-22 10:14:28,990 WARN L192 SmtUtils]: Spent 2.70 s on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-11-22 10:14:32,535 WARN L192 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-11-22 10:14:33,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:14:33,777 INFO L93 Difference]: Finished difference Result 396 states and 499 transitions. [2019-11-22 10:14:33,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 10:14:33,779 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2019-11-22 10:14:33,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:14:33,781 INFO L225 Difference]: With dead ends: 396 [2019-11-22 10:14:33,781 INFO L226 Difference]: Without dead ends: 390 [2019-11-22 10:14:33,782 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-11-22 10:14:33,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-11-22 10:14:33,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 353. [2019-11-22 10:14:33,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-11-22 10:14:33,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 462 transitions. [2019-11-22 10:14:33,793 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 462 transitions. Word has length 33 [2019-11-22 10:14:33,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:14:33,793 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 462 transitions. [2019-11-22 10:14:33,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-22 10:14:33,794 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 462 transitions. [2019-11-22 10:14:33,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-22 10:14:33,795 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:14:33,795 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:14:33,995 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:33,996 INFO L410 AbstractCegarLoop]: === Iteration 14 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:14:33,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:14:33,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1447512898, now seen corresponding path program 1 times [2019-11-22 10:14:33,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:14:33,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [836481891] [2019-11-22 10:14:33,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:14:34,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-22 10:14:34,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:14:35,001 WARN L192 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-22 10:14:35,002 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-22 10:14:35,002 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2019-11-22 10:14:35,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:35,160 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-11-22 10:14:35,161 INFO L567 ElimStorePlain]: treesize reduction 50, result has 53.3 percent of original size [2019-11-22 10:14:35,162 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:14:35,162 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:28, output treesize:12 [2019-11-22 10:14:35,182 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-11-22 10:14:35,182 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:35,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:35,193 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:14:35,193 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:10 [2019-11-22 10:14:35,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:14:35,263 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-22 10:14:35,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:35,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:35,281 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 10:14:35,281 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:22 [2019-11-22 10:14:35,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:35,348 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:14:35,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:35,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:36,000 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-22 10:14:36,484 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-11-22 10:14:36,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:36,709 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:36,710 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-22 10:14:36,716 INFO L168 Benchmark]: Toolchain (without parser) took 59148.02 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 452.5 MB). Free memory was 957.7 MB in the beginning and 1.2 GB in the end (delta: -247.7 MB). Peak memory consumption was 204.7 MB. Max. memory is 11.5 GB. [2019-11-22 10:14:36,716 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 10:14:36,716 INFO L168 Benchmark]: CACSL2BoogieTranslator took 668.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -154.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-22 10:14:36,717 INFO L168 Benchmark]: Boogie Preprocessor took 91.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-22 10:14:36,717 INFO L168 Benchmark]: RCFGBuilder took 929.63 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: 63.6 MB). Peak memory consumption was 63.6 MB. Max. memory is 11.5 GB. [2019-11-22 10:14:36,718 INFO L168 Benchmark]: TraceAbstraction took 57453.53 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 304.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -163.7 MB). Peak memory consumption was 140.4 MB. Max. memory is 11.5 GB. [2019-11-22 10:14:36,720 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.33 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 668.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -154.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 91.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 929.63 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: 63.6 MB). Peak memory consumption was 63.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 57453.53 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 304.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -163.7 MB). Peak memory consumption was 140.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...